On Linear Programming Duality and
Landau's Characterization of Tournament Scores

Allan B. Cruse
Mathematics Department
University of San Francisco
March 1978



Abstract

H. G. Landau [1953] characterized those integer-sequences which can arise as the score-vectors in an ordinary round-robin tournament among   n   contestants.   This note exhibits Landau's theorem as an instance of the Duality Principle from linear programming, and points out how this LP approach suggested a generalization of Landau's result going beyond the well-known extension due to J. W. Moon [1963].


Here is a scanned copy of the author's unpublished preprint [1978] in .PDF format


Website created on 27 JAN 2014; Last updated on 31 JAN 2014