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

We study all-pay contests under incomplete information where the reward is a function of the contestant's type and effort. We analyse the optimal reward for the designer when the reward is either multiplicatively separable or additively separable in effort and type. In the multiplicatively...

We study all-pay contests in which there is a positive probability of a tied outcome. We analyse both one-stage contests and multi-stage contests with tie-breaks. We demonstrate that in symmetric two-player contests, the designer does not have an incentive to award a prize in a case of a tie....

We study a round-robin tournament with n symmetric players where in each of the n-1 stages each of the players competes against a different player in the Tullock contest. Each player has a limited budget of effort that decreases within the stages proportionally to the effort he exerted in the...