On linear programming duality and Landau’s characterization of tournament
| Jun 27, 2014
About this article
Published Online: Jun 27, 2014
Page range: 21 - 32
Received: Jan 25, 2014
DOI: https://doi.org/10.2478/ausi-2014-0016
Keywords
© 2014
This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
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: