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 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.
Original language | English |
---|---|
Journal | Physica A: Statistical Mechanics and its Applications |
Volume | 338 |
Issue number | 3-4 |
Pages (from-to) | 596-604 |
Number of pages | 9 |
ISSN | 0378-4371 |
DOIs | |
Publication status | Published - 15 Jul 2004 |
Keywords
- Information filtering
- Tournament design