Selection by pairwise comparisons with limited resources
  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. 
Paolo Laureti, Joachim Mathiesen, and Yi-Cheng Zhang