Selection by pairwise comparisons with limited resources

Paolo Laureti, Joachim Mathiesen and Yi-Cheng Zhang
Additional contact information
Joachim Mathiesen: The Niels Bohr Institute, Blegdamsvej 17, Copenhagen, Denmark
Yi-Cheng Zhang: Département de Physique Théorique, Université de Fribourg, Pérolles CH-1700, Switzerland

Game Theory and Information from University Library of Munich, Germany

Abstract: We analyze different methods of sorting and selecting a set of objects by their intrinsic value, via pairwise comparisons whose outcome is uncertain. After discussing the limits of repeated Round Robins, two new methods are presented: The {\it ran-fil} requires no previous knowledge on the set under consideration, yet displaying good performances even in the least favorable case. The {\it min-ent} method sets a benchmark for optimal dynamic tournaments design.

Keywords: Tournament design; information filtering; paired comparisons (search for similar items in EconPapers)
JEL-codes: C7 D8 (search for similar items in EconPapers)
Pages: 10 pages
Date: 2004-06-28
Note: Type of Document - pdf; pages: 10
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/0406/0406003.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wpa:wuwpga:0406003

Access Statistics for this paper

More papers in Game Theory and Information from University Library of Munich, Germany
Bibliographic data for series maintained by EconWPA ( this e-mail address is bad, please contact ).