DP9873 Optimal Allocations in Round-Robin Tournaments
|Author(s):||Alex Krumer, Reut Megidish, Aner Sela|
|Publication Date:||March 2014|
|Keyword(s):||All-pay auctions, Round-robin tournaments|
|JEL(s):||D44, D72, D82|
|Programme Areas:||Industrial Organization|
|Link to this Page:||cepr.org/active/publications/discussion_papers/dp.php?dpno=9873|
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 players have the same value) and asymmetric players (each one is either weak (low value) or strong (high value)) and prove that if the asymmetry between the players' values are relatively weak, each player maximizes his expected payoff if he competes in the first and the last stages of the tournament. Moreover, even when the asymmetry between the players' values are relatively strong, the strong players maximize their expected payoffs if they compete in the first and the last stages. We show that a contest designer who wishes to maximize the length of the tournament such that the winner of the tournament will be decided in the last stage should allocate the stronger players in the last stage. But if he wishes to maximize the players' expected total effort he should not allocate them in the last stage of the tournament.