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

We study the classical Tullock's model of one-stage contests where the probability of winning is a function of the efforts exerted by the contestants. We show that by a simple non-discriminating rule the contest designer is able to manipulate the outcome of the contest such that the...

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 two-player all-pay contests in which there is a positive probability of a tied outcome. We show that the players' efforts in equilibrium do not depend on the expected prize in the case of a tie given that this prize is smaller than the prize for winning. The implications of this result...

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 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 with effort-dependent rewards under incomplete information. A contestant's value to winning depends not only on his type but also on the effort-dependent reward chosen by the designer. We analyze which reward is optimal for the designer when his objective is either...