The Predictive Power of Three Prominent Tournament Formats
AbstractTournaments of heterogeneous candidates can be thought of as probabilistic mechanisms that select high-quality agents. We quantify the efficiency of such selection by the likelihood of selecting the best player, here termed the "predictive power." We study three widely used tournament formats: contests, binary elimination tournaments, and round-robin tournaments. Using a simple model, we demonstrate analytically, and through simulations, how the predictive power of these formats depends on the number of players, noise level, and distribution of players' types. We also present the results of exploratory simulations for two alternative criteria of selection efficiency: the expected ability of the winner and the expected rank of the winner. All three criteria may exhibit unexpected nonmonotonic behavior as functions of the number of players and/or noise level. We discuss the conditions under which different types of behavior should be expected, and their implications for managerial decisions.
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 InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 54 (2008)
Issue (Month): 3 (March)
tournament; design; predictive power; selection; tournament format;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- E. Glenn Dutcher & Loukas Balafoutas & Florian Lindner & Dmitry Ryvkin & Matthias Sutter, 2013. "Strive to be first or avoid being last: An experiment on relative performance incentives," Working Papers 2013-08, Faculty of Economics and Statistics, University of Innsbruck.
- Lindner, Florian & Dutcher, E. Glenn & Balafoutas, Loukas & Ryvkin, Dmitry & Sutter, Matthias, 2013.
"Strive to be first and avoid being last: An experiment on relative performance incentives,"
Annual Conference 2013 (Duesseldorf): Competition Policy and Regulation in a Global Economic Order
79885, Verein für Socialpolitik / German Economic Association.
- Lindner, Florian & Dutcher, E. Glenn & Balafoutas, Loukas & Ryvkin, Dmitry & Sutter, Matthias, 2013. "Strive to be first and avoid being last: An experiment on relative performance incentives," Munich Reprints in Economics 19235, University of Munich, Department of Economics.
- Loukas Balafoutas & Glenn Dutcher & Florian Lindner & Dmitry Ryvkin, 2012. "The optimal allocation of prizes in tournaments of heterogeneous agents," Working Papers 2012-08, Faculty of Economics and Statistics, University of Innsbruck.
- Rudi Stracke & Wolfgang Höchtl & Rudolf Kerschbamer & Uwe Sunde, 2014. "Incentives and selection in promotion contests: Is it possible to kill two birds with one stone?," Working Papers 2014-09, Faculty of Economics and Statistics, University of Innsbruck.
- Erez, Eyal & Sela, Aner, 2010. "Round-Robin Tournaments with Effort Constraints," CEPR Discussion Papers 8021, C.E.P.R. Discussion Papers.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.