We study a sequential Tullock contest with two stages and two identical prizes. The players compete for one prize in each stage and each player may win either one or two prizes. The players have either decreasing or increasing marginal values for the prizes, which are commonly known, and there...

We study a sequential all-pay auction where heterogeneous contestants are privately informed about a parameter (ability) that affects their cost of effort. In the case of two contestants, contestant 1 (the first mover) makes an effort in the first period, while contestant 2 (the second mover)...

We study all-pay contests with an exogenous minimal effort constraint where a player can participate in a contest only if his effort (output) is equal to or higher than the minimal effort constraint. Contestants are privately informed about a parameter (ability) that affects their cost of...

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 round-robin tournaments with one prize and four symmetric players. There are three rounds, each of which includes two sequential matches where each player plays against a different opponent in every round. Each pair-wise match is modelled as an all-pay auction. We characterize the...

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