We study two-stage all-pay auctions with two identical prizes. In each stage, players compete for one prize. Each player may win either one or two prizes. We analyze the equilibrium strategies where players' marginal values for the prizes are either declining or inclining.

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

We study a three-stage all-pay auction with two players in which the first player to win two matches wins the best-of-three all-pay auction. The players have values of winning the contest and may have also values of losing, the latter depending on the stage in which the contest is decided. It is...