Geodesic
Computation of the Number of Score Sequences in Round-Robin Tournaments
Canadian mathematical bulletin, Tome 7 (1964) no. 1, pp. 133-136

Voir la notice de l'article provenant de la source Cambridge University Press

We consider round-robin tournaments of n players in which, at each encounter, the winner is awarded 1 point and the loser 0 (ties are excluded).Let 1 be the n scores, ordered in a non-decreasing sequence. Clearly 2 
Narayana, T.V.; Bent, D.H. Computation of the Number of Score Sequences in Round-Robin Tournaments. Canadian mathematical bulletin, Tome 7 (1964) no. 1, pp. 133-136. doi: 10.4153/CMB-1964-015-1
@article{10_4153_CMB_1964_015_1,
     author = {Narayana, T.V. and Bent, D.H.},
     title = {Computation of the {Number} of {Score} {Sequences} in {Round-Robin} {Tournaments}},
     journal = {Canadian mathematical bulletin},
     pages = {133--136},
     year = {1964},
     volume = {7},
     number = {1},
     doi = {10.4153/CMB-1964-015-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-015-1/}
}
TY  - JOUR
AU  - Narayana, T.V.
AU  - Bent, D.H.
TI  - Computation of the Number of Score Sequences in Round-Robin Tournaments
JO  - Canadian mathematical bulletin
PY  - 1964
SP  - 133
EP  - 136
VL  - 7
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-015-1/
DO  - 10.4153/CMB-1964-015-1
ID  - 10_4153_CMB_1964_015_1
ER  - 
%0 Journal Article
%A Narayana, T.V.
%A Bent, D.H.
%T Computation of the Number of Score Sequences in Round-Robin Tournaments
%J Canadian mathematical bulletin
%D 1964
%P 133-136
%V 7
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1964-015-1/
%R 10.4153/CMB-1964-015-1
%F 10_4153_CMB_1964_015_1

[1] 1. David, H. A., Tournaments and Paired Comparisons. Biometrika, Vol. 46, Parts I and II, 139–149. Google Scholar

[2] 2. Landau, H. G., On dominance relations, and the structure of animal societies, III. The condition for a score structure. Bull. Math. Biophysics, 15(1963), 143–148. Google Scholar

[3] 3. Moon, J. W., On the score sequence of an N-Partite Tournament. Canad. Math. Bull., Vol. 5, No. 1, Jan. 1962, 51–58. Google Scholar

[4] 4. Moon, J. W. and Moser, L., Almost all Tournaments are Irreducible. Canad. Math. Bull., Vol. 5, No. 1, Jan. 1962, 61–65. Google Scholar

Cité par Sources :