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 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 study two-stage political contests with private entry costs. We show that these political contests could be ineffective, namely, the chance of low ability candidates participating in the contest might be higher than the chance of high ability candidates participating in the contest (and...

We study optimal contest design in situations where the designer can reward high performance agents with positive prizes and punish low performance agents with negative prizes. We link the optimal prize structure to the curvature of distribution of abilities in the population. In particular, we...

We study asymmetric all-pay auctions with multiple objects where players’ values for the objects are common knowledge. The players have different values for the objects but they have the same ranking. The contest designer may award one prize including all the objects to the player with the...

We study auctions where bidders have private information about their entry costs and the seller does not benefit from these entry costs. We consider a symmetric environment where all bidders have the same value for the object being sold, and also an asymmetric environment where bidders may have...

We study second price auctions with weakly asymmetric interdependent values where bidders' signals for the value are independently and identically distributed. We also prove an asymptotic revenue equivalence among all standard auctions with weakly asymmetric interdependent values.

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...

We study multi-stage sequential all-pay contests (auctions) where heterogeneous contestants are privately informed about a parameter (ability) that affects their cost of effort. We characterize the sub-game perfect equilibrium of these multi-stage sequential all-pay contests and analyze 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...