Acceso abierto

On linear programming duality and Landau’s characterization of tournament


Cite

H. G. Landau has characterized those integer-sequences S = (s1, s2, . . . , sn) which can arise as score-vectors in an ordinary round-robin tournament among n contestants [17]. If s1 ≤ s2 ≤ · · · ≤ sn, the relevant conditions are expressed simply by the inequalities:

eISSN:
2066-7760
Idioma:
Inglés
Calendario de la edición:
2 veces al año
Temas de la revista:
Computer Sciences, other