Hostname: page-component-77c89778f8-m8s7h Total loading time: 0 Render date: 2024-07-19T12:34:57.010Z Has data issue: false hasContentIssue false
  • English
  • Français

Upsets in Round Robin Tournaments

Published online by Cambridge University Press:  20 November 2018

D. R. Fulkerson
D. R. Fulkerson*
Affiliation:
The RAND Corporation, Santa Monica, California, U.S.A.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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 tournament can be conveniently recorded in a square (0, 1)-matrix T = (tij) of order n by setting tij = 1 if player i defeats player j , tij = 0 if player i loses to player j , and tii = 0. Thus T has 0's along the main diagonal, and in the off-diagonal positions T satisfies the "skew-symmetry" condition that tij = 1 if and only if tji = 0. We call such a (0, 1)-matrix T a tournament matrix.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 17 , 1965 , pp. 957 - 969
Copyright
Copyright © Canadian Mathematical Society 1965

References

1. Ford, L. R. Jr. and Fulkerson, D. R., Flows in networks (Princeton, 1962).Google Scholar
2. Landau, H. G., On dominance relations and the structure of animal societies] III. The conditions for a score structure, Bull. Math. Biophys., 15 (1953), 143–148.Google Scholar
3. Moon, J. W., An extension of Landau's theorem on tournaments, Pacific J. Math., 18 (1963), 1343–1347.Google Scholar
4. Ryser, H. J., Matrices of zeros and ones in combinatorial mathematics, Recent Advances in Matrix Theory (Madison, Wis., 1964).Google Scholar