Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.



Round robins
Posted:
Jul 16, 1996 9:01 PM


Hi,
Suppose I have 2n teams, and I want to play the first few rounds of a roundrobin competition, in which I want matches to be as even as possible. The teams are ranked 1 ... 2n .
That is, I want an algorithm to spit out k << n rounds, where each round consists of n matches that can be played simultaneously, and such that SUM difference in rank matches
is close to minimal. (Depends on k, probably.)
Any references to like problems would be appreciated.
Steve



