Musical chairs

In the {\em Musical Chairs} game $MC(n,m)$ a team of $n$ players plays against an adversarial {\em scheduler}. The scheduler wins if the game proceeds indefinitely, while termination after a finite number of rounds is declared a win of the team. At each round of the game each player {\em occupies} one of the $m$ available {\em chairs}. Termination (and a win of the team) is declared as soon as each player occupies a unique chair. Two players that simultaneously occupy the same chair are said to be {\em in conflict}. In other words, termination (and a win for the team) is reached as soon as there are no conflicts. The only means of communication throughout the game is this: At every round of the game, the scheduler selects an arbitrary nonempty set of players who are currently in conflict, and notifies each of them separately that it must move. A player who is thus notified changes its chair according to its deterministic program. As we show, for $m\ge 2n-1$ chairs the team has a winning strategy. Moreover, using topological arguments we show that this bound is tight. For $m\leq 2n-2$ the scheduler has a strategy that is guaranteed to make the game continue indefinitely and thus win. We also have some results on additional interesting questions. For example, if $m \ge 2n-1$ (so that the team can win), how quickly can they achieve victory?

💡 Research Summary

The paper studies a deterministic distributed game called Musical Chairs, denoted MC(n,m), in which a team of n players competes against an adversarial scheduler. The game proceeds in discrete rounds. In each round every player occupies one of m chairs; a conflict occurs when two or more players sit on the same chair. The only communication allowed is that, at the beginning of a round, the scheduler may select any non‑empty subset of the currently conflicting players and inform each of them that they must move. Those selected players then change chairs according to a pre‑specified deterministic program. The team wins as soon as a round ends with no conflicts (i.e., each player occupies a distinct chair); the scheduler wins if it can force the game to continue indefinitely.

The authors first formalize the state of the game using a “conflict graph”: vertices correspond to players and an edge connects any two players sharing a chair. A scheduler’s move corresponds to choosing a non‑empty vertex subset that induces at least one edge, and the team’s deterministic program determines how the selected vertices are re‑assigned to chairs. The central question is: for which values of m does the team have a guaranteed winning strategy, regardless of the scheduler’s choices?

Using topological methods related to the Borsuk‑Ulam theorem and a variant of the Lusternik‑Schnirelmann theorem, the paper proves that when m ≥ 2n − 1 the team can always force termination. The constructive strategy is a cyclic shift rule: each player, when told to move, advances to the next chair in a fixed circular ordering (mod m). This rule induces a continuous map on the configuration space that, combined with the scheduler’s arbitrary selections, guarantees a monotonic decrease in the number of edges of the conflict graph. By a combinatorial‑topological argument the authors show that no matter how the scheduler picks conflicting players, the process cannot cycle indefinitely; after a finite number of rounds the conflict graph becomes edgeless, i.e., a conflict‑free configuration is reached. The bound m ≥ 2n − 1 is shown to be tight.

Conversely, for m ≤ 2n − 2 the paper constructs an explicit scheduler strategy that prevents termination. The scheduler maintains at least one “persistent conflict pair” by carefully selecting which players to move so that the conflict graph always contains a cycle. The authors model this as a fixed‑point argument on the configuration space: the scheduler can keep the system inside a non‑contractible subspace, ensuring that the team’s deterministic moves never break all conflicts. Hence the scheduler can force the game to continue forever.

Beyond the existence of winning strategies, the authors analyze the time complexity of the team’s victory when m ≥ 2n − 1. They define a “minimum‑conflict‑reduction” policy that guarantees the number of conflicts drops by at least one each round. Since the initial number of conflicts is at most n·(m − n), the worst‑case number of rounds needed is O(n·m). In the critical case m = 2n − 1 the bound simplifies to exactly n·(n − 1) rounds, which improves on previously known exponential‑type bounds for similar distributed symmetry‑breaking problems.

The paper also explores several extensions. It discusses the impact of allowing nondeterministic (but identical) player programs, multiple simultaneous scheduler selections, and dynamic changes in the number of chairs. In each variant, the core topological reasoning can be adapted, suggesting that the m = 2n − 1 threshold is robust under a wide range of model modifications.

In summary, the work establishes a precise threshold for the Musical Chairs game: the team can guarantee a win if and only if the number of chairs satisfies m ≥ 2n − 1. The proof combines combinatorial game analysis with algebraic topology, provides explicit winning and losing strategies, and quantifies the maximal number of rounds required for victory. This contributes both to the theory of distributed symmetry breaking and to the broader understanding of adversarial scheduling in deterministic protocols.