We study all-pay auctions with budget-constrained bidders who have access to fair insurance before bidding simultaneously over a prize. We characterize a unique equilibrium for the special cases of two bidders and one prize, show existence and a heuristic for finding an equilibrium in the case of multiple bidders and multiple prizes. We end with an example of non-uniqueness of equilibria for the general case of multiple prizes and multiple players.all-pay auctions; fair lotteries; political campaigning; oligopoly; regional competition; patent races
We study N-bidders, asymmetric all-pay auctions under incomplete information. First, we solve for th...
We study the following game: each agent i chooses a lottery over nonnegative numbers whose expectati...
We analyze (non-deterministic) contests with anonymous contest success functions. There is no restri...
Consider an all-pay auction with interdependent, affiliated valuations and private budget constraint...
We consider all-pay auctions in the presence of interdependent, affiliated valuations and private bu...
We study two-stage all-pay auctions with two identical prizes. In each stage, players compete for on...
In a (first price) all-pay auction, bidders simultaneously submit bids for an item. All players forf...
I solve a first-price auction for two bidders with asymmetric budget distributions and known valuati...
We study the inefficiency of mixed equilibria, expressed as the price of anarchy, of all-pay auction...
This paper generalizes the results of Siegel (2009) to support contestants who are faced with const...
Three all-pay auction models are examined. The first is a symmetric two-player binary-signal all-pay...
We analyze (non-deterministic) contests with anonymous contest success functions. There is no restr...
This paper introduces constraints on player choices in a broad class of all-pay auctions by allowing...
In an article published in this journal, Rapoport and Amaldoss (2000, Journal of Economic Behavior a...
This paper considers all-pay contests in which the relationship between bids and allocations reflect...
We study N-bidders, asymmetric all-pay auctions under incomplete information. First, we solve for th...
We study the following game: each agent i chooses a lottery over nonnegative numbers whose expectati...
We analyze (non-deterministic) contests with anonymous contest success functions. There is no restri...
Consider an all-pay auction with interdependent, affiliated valuations and private budget constraint...
We consider all-pay auctions in the presence of interdependent, affiliated valuations and private bu...
We study two-stage all-pay auctions with two identical prizes. In each stage, players compete for on...
In a (first price) all-pay auction, bidders simultaneously submit bids for an item. All players forf...
I solve a first-price auction for two bidders with asymmetric budget distributions and known valuati...
We study the inefficiency of mixed equilibria, expressed as the price of anarchy, of all-pay auction...
This paper generalizes the results of Siegel (2009) to support contestants who are faced with const...
Three all-pay auction models are examined. The first is a symmetric two-player binary-signal all-pay...
We analyze (non-deterministic) contests with anonymous contest success functions. There is no restr...
This paper introduces constraints on player choices in a broad class of all-pay auctions by allowing...
In an article published in this journal, Rapoport and Amaldoss (2000, Journal of Economic Behavior a...
This paper considers all-pay contests in which the relationship between bids and allocations reflect...
We study N-bidders, asymmetric all-pay auctions under incomplete information. First, we solve for th...
We study the following game: each agent i chooses a lottery over nonnegative numbers whose expectati...
We analyze (non-deterministic) contests with anonymous contest success functions. There is no restri...