A Variant of the Round-Robin Scheduling Problem

Abstract

We consider the following variant of the round-robin scheduling problem: 2 n people play a number of rounds in which two opposing teams of n players are reassembled in each round. Each two players should play at least once in the same team, and each two players should play at least once in opposing teams. We provide an explicit formula for calculating the minimal numbers of rounds needed to satisfy both conditions. Moreover, we also show how one can construct the corresponding playing schedules.