Accession Number:

AD0606591

Title:

A TOURNAMENT PROBLEM,

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CALIF

Report Date:

1958-05-09

Pagination or Media Count:

9.0

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.

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE