The Predictive Power of Three Prominent Tournament Formats
Tournaments 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.
Volume (Year): 54 (2008)
Issue (Month): 3 (March)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:54:y:2008:i:3:p:492-504. See general 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: (Mirko Janc)
If references are entirely missing, you can add them using this form.