Upsets in Round Robin Tournaments
Work
Year: 1965
Type: article
Abstract: Consider a round robin tournament in which each of n players is required to play precisely one game with each other player, and assume that each game ends in a win or a loss. The results of such a tou... more
Source: Canadian Journal of Mathematics
Author D. R. Fulkerson
Institution RAND Corporation
Cites: 2
Cited by: 33
Related to: 10
FWCI: 0.799
Citation percentile (by year/subfield): 92.89
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze