We study a contest with multiple, nonidentical prizes. Participants are privately informed about a parameter (ability) affecting their costs of effort. The contestant with the highest effort wins the first prize, the contestant with the second-highest effort wins the second prize, and so on...

We study a sequential two-stage all-pay auction with two identical prizes. In each stage, the players compete for one prize and each player may win either one or two prizes. The designer may impose a cap on the players' bids in each of the stages. We analyze the equilibrium in this sequential...

We study all-pay auctions with multiple prizes. The players have the same value for all the certain prizes except for one uncertain prize for which each player has a private value. We characterize the equilibrium strategy and show that, independent of the ranking of the uncertain prize, if the...

We study round-robin tournaments with three players whose values of winning are common knowledge. In every stage a pair-wise match is modelled as an all-pay auction. The player who wins in two matches wins the tournament. We characterize the sub-game perfect equilibrium for symmetric (all...

We study two-player common-value all-pay auctions (contests) with asymmetric information under the assumption that one of the players has an information advantage over his opponent. We characterize the unique equilibrium in these contests, and examine the role of information in determining the...

We consider a battle between two groups D (defenders) and A (attackers). Each group has the same number of agents, but they differ by their abilities. Every agent confronts only one opponent from the other group once in either an all-pay contest or a Tullock contest such that the number of the...

We study two-player common-value all-pay auctions (contests) with asymmetric information under the assumption that one of the players has an information advantage over his opponent and both players are budget-constrained. We generalize the results for all-pay auctions with complete information,...

We use perturbation analysis to study independent private-value all-pay auctions with weakly risk-averse buyers. We show that under weak risk aversion: 1) Buyers with low values bid lower and buyers with high values bid higher than they would bid in the risk neutral case. 2) Buyers with low...

We study an elimination tournament with heterogenous contestants whose ability is common-knowledge. Each pair-wise match is modeled as an all-pay auction where the winner gets the right to compete at the next round. Equilibrium efforts are in mixed strategies, yielding rather complex play...

We study all-pay auctions with multiple prizes. The players have the same value for all the certain prizes except for one uncertain prize for which each player has a private value. We characterize the equilibrium strategy and show that if the number of prizes is smaller than the number of...