Selection by pairwise comparisons with limited resources

Paolo Laureti*, Joachim Mathiesen, Yi Cheng Zhang

*Corresponding author for this work
1 Citation (Scopus)

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 languageEnglish
JournalPhysica A: Statistical Mechanics and its Applications
Volume338
Issue number3-4
Pages (from-to)596-604
Number of pages9
ISSN0378-4371
DOIs
Publication statusPublished - 15 Jul 2004

Keywords

  • Information filtering
  • Tournament design

Fingerprint

Dive into the research topics of 'Selection by pairwise comparisons with limited resources'. Together they form a unique fingerprint.

Cite this