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