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 (Stackelberg) all-pay auction with two contestants who are privately informed about a parameter (ability) that affects their cost of effort. Contestant 1 (the fi?rst mover) exerts an effort in the fi?rst period, while contestant 2 (the second mover) observes the effort of...

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

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 a sequential all-pay auction with two contestants who are privately informed about a parameter (ability) that affects their cost of effort. In the model, contestant 1 (the first mover) exerts an effort in the first period which translates into an observable output but with some noise,...

We study round-robin and elimination tournaments with three players where one player is dominant, i.e., he has a higher value of winning than his weaker opponents. In every stage, a pair-wise match is modelled as an all-pay auction. We demonstrate that the expected payoff of the weak players in...