The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Round robins
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  

Posts: 14
Registered: 12/12/04
Round robins
Posted: Jul 16, 1996 9:01 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


Suppose I have 2n teams, and I want to play the first few rounds
of a round-robin 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|

is close to minimal.
(Depends on k, probably.)

Any references to like problems would be appreciated.


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.