Accession Number : AD0606591

Title :   A TOURNAMENT PROBLEM,

Corporate Author : RAND CORP SANTA MONICA CALIF

Personal Author(s) : Ford,Lester R. ,Jr. ; Johnson,Selmer M.

Report Date : 09 MAY 1958

Pagination or Media Count : 9

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.'

Descriptors :   (*GAME THEORY, OPTIMIZATION), ITERATIONS, FUNCTIONS(MATHEMATICS), SERIES(MATHEMATICS), NUMERICAL ANALYSIS

Distribution Statement : APPROVED FOR PUBLIC RELEASE