We study a best-of-two contest with two homogeneous players (teams). The winner is the player who wins in both stages. In the case of one victory for each team, a draw determines the identity of the winner. Each team has a value of winning the contest as well as a value of winning a single game....

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

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 a best-of-three all-pay contest with two players in which the first player to win two games wins the contest. Each player has a value of winning the contest as well as a value of winning a single game. It is assumed that a player’s value of winning a game in his home field is...