On Knock-Out Tournaments
Canadian mathematical bulletin, Tome 13 (1970) no. 1, pp. 105-109
Voir la notice de l'article provenant de la source Cambridge University Press
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 ).
Capell, P.; Narayanan, T. V. On Knock-Out Tournaments. Canadian mathematical bulletin, Tome 13 (1970) no. 1, pp. 105-109. doi: 10.4153/CMB-1970-021-1
@article{10_4153_CMB_1970_021_1,
author = {Capell, P. and Narayanan, T. V.},
title = {On {Knock-Out} {Tournaments}},
journal = {Canadian mathematical bulletin},
pages = {105--109},
year = {1970},
volume = {13},
number = {1},
doi = {10.4153/CMB-1970-021-1},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1970-021-1/}
}
[1] 1. Moon, J. W., Topics on tournaments, Holt, Rinehart and Winston, N.Y. (1968), p. 49. Google Scholar
[2] 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] 3. Tucker, H. G., Introduction to Probability and Mathematical Statistics, Academic Press, N.Y., p. 18. Google Scholar
Cité par Sources :