Selection by pairwise comparisons with limited resources
Paolo Laureti, Joachim Mathiesen, Yi-Cheng Zhang · 2004
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 ran-fil requires no previous knowledge on the set under consideration, yet displaying good performances even in the least favorable case. The min-ent method sets a benchmark for optimal dynamic tournaments design. Key words: Tournament design, information filtering