Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-14T17:27:15.919Z Has data issue: false hasContentIssue false
  • English
  • Français

On Knock-Out Tournaments

Published online by Cambridge University Press:  20 November 2018

P. Capell and
T. V. Narayanan
P. Capell
Affiliation:
University of Alberta, Edmonton, Alberta
T. V. Narayanan
Affiliation:
University of Alberta, Edmonton, Alberta
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.

We define, as in [2], a random knock-out tournament with n players as a vector (m 1, m 2, …, m k ) of positive integers satisfying

1

On the first round of the tournament 2m1 players, chosen at random, are paired off randomly; the remaining n — 2m1 players have a "bye". The m 1 losers are knocked out, leaving a tournament n—m 1 players with vector (m 2, m 3, …, m k ).

Information

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 13 , Issue 1 , March 1970, pp. 105 - 109
Copyright
Copyright © Canadian Mathematical Society 1970

References

1. Moon, J. W., Topics on tournaments, Holt, Rinehart and Winston, N.Y. (1968), p. 49.Google Scholar
2. Narayana, T. V., Quelques résultats relatifs aux tournois "knock-out" et leurs applications aux comparaisons aux paires, Comptes Rendus de l' Académie des Sciences, Paris, 267 (1968), 32-33.Google Scholar
3. Tucker, H. G., Introduction to Probability and Mathematical Statistics, Academic Press, N.Y., p. 18.Google Scholar