
#1
Aug2213, 04:27 PM

P: 1

Hello,
I am having a competition with up to 60 teams. My idea was to break the 60 teams into 10 groups of 6 teams each and run a Round Robin tournament for each individual group. Simple. Here is my problem: What if less than 60 teams show up to the competition (i.e. 58 teams)? An idea I am exploring for fairness is to pair up X opponents to each team from the entire pool of N teams, without pairing the same teams twice. Is this possible and if so, is there an algorithm that can do this? Thanks, 



#2
Aug2213, 06:29 PM

Mentor
P: 10,864

I think some teams with 6 and some with 5 (selected randomly) are not significantly less fair than 10 teams with 6 (again, selected randomly  you can get harder and easier groups there anyway). If you want to keep the number of matches for each team the same, let the teams in the smaller groups make matches against (random?) teams in other groups.




#3
Aug2213, 11:49 PM

P: 133

Now, randomly select 5 of the 57 rounds from the schedule. Play only those rounds. Voila! You have a tournament where each team plays exactly 5 others and no two teams play each other twice. Alternatively, you could use the Swiss system, which has the property that most teams will be paired against other teams with similar records. Whether that is desirable or undesirable depends on the nature of your tournament, I suppose. 


Register to reply 
Related Discussions  
robin hood probability  Calculus & Beyond Homework  5  
Cyclical Integration by Parts, going round and round  Calculus & Beyond Homework  7  
Robin Hood  History & Humanities  1  
VOTE PF Photo Contest  Going 'Round And 'Round  General Discussion  14  
Spaceships a'turnin round and round  in space  Astrophysics  5 