Round-Robin Tournaments With Effort Constraints
AbstractWe 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 previous stages. We show that when the prize for winning (value of winning) is equal between the stages, a player's effort is weakly decreasing over the stages. We also show how the contest designer can influence the players' allocation of effort by changing the distribution of prizes between the stages. In particular, we analyze the distribution of prizes over the stages that balance the effort allocation such that a player exerts the same effort over the different stages. In addition, we analyze the distribution of prizes over the stages that maximizes the players' expected total effort.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Ben-Gurion University of the Negev, Department of Economics in its series Working Papers with number 1009.
Length: 20 pages
Date of creation: 2010
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-11-27 (All new papers)
- NEP-CDM-2010-11-27 (Collective Decision-Making)
- NEP-GTH-2010-11-27 (Game Theory)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Aamer Abu-Qarn).
If references are entirely missing, you can add them using this form.