DP10081 Round-Robin Versus Elimination in Tournaments with a Dominant Player
|Author(s):||Alex Krumer, Reut Megidish, Aner Sela|
|Publication Date:||July 2014|
|Keyword(s):||all-pay auctions, elimination tournaments, round-robin tournaments|
|Programme Areas:||Industrial Organization|
|Link to this Page:||cepr.org/active/publications/discussion_papers/dp.php?dpno=10081|
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 the round-robin tournament is higher than or equal to their expected payoffs in the elimination tournament. On the other hand, the expected payoff of the dominant player in the elimination tournament could be either higher or lower than in the round-robin tournament. We also show that if a contest designer wishes to maximize the dominant player's probability to win he should organize a round-robin tournament. However, if he wishes to maximize the players' expected total effort, then if the asymmetry between the players is relatively low, he should prefer the elimination tournament, while if the asymmetry is relatively high, he should prefer the round-robin tournament.