Summary: Mathematics
and
Statistics
COLLOQUIUM
Brett Stevens
Carleton University
Optimizing an imperfect
tournament
Date: Friday, July 30th
Time: 2:00 - 3:00 pm
Room: Math Department Lounge
Abstract:
A computer science department holds an annual video game olympics with 64
participants playing 8 games. There are 8 rooms, each with a fixed video game
and there are 8 rounds. In each round 8 people will be in each room. Every
person will play each game exactly once. We would like to find a schedule for
all the players, rooms and rounds that is as balanced as possible, i.e. no pair of
players plays together in the same room too frequently and few pairs of people
playing together are missed. It can be shown that some pairs must be missed
and some pairs must repeat. We set up a combinatorial framework to quantify

Source: Argerami, Martin - Department of Mathematics and Statistics, University of Regina

Collections: Mathematics