Perpetually Fair Assignments Via Balanced Sequences of Permutations

Terrence Adams, Erel Segal-Halevi

There is a set of $n$ indivisible items (goods or chores), and a set of $n$ players. Each day, a single item should be assigned to each player. Assignments based on latin squares g…