A Tournament Problem
Lester Randolph Ford, Selmer Martin Johnson · American Mathematical Monthly · 1959
Abstract : An improved solution is presented for the problem of finding the smallest number of direct pairwise comparisons which will always suffice to rank n objects according to some transitive characteristic. In his book, Mathematical Snapshots, Steinhaus discusses the problem of ranking n objects according to some transitive characteristic, by means of successive pairwise comparisons. In this paper, the terminology was adopted of a tennis tournament by n players. The problem may be briefly stated: 'What is the smallest number of matches which will always suffice to rank all n players.'
Cited by 116 works. doi:10.1080/00029890.1959.11989306