On the complexity of Client-Waiter and Waiter-Client games

TL;DR

This paper investigates the computational complexity of Client-Waiter and Waiter-Client positional games, establishing PSPACE-completeness for Client-Waiter and an FPT algorithm for Waiter-Client, advancing understanding of their algorithmic boundaries.

Contribution

It proves PSPACE-completeness of Client-Waiter on 6-uniform hypergraphs and introduces an FPT algorithm for Waiter-Client based on the largest edge size.

Findings

Client-Waiter is PSPACE-complete on 6-uniform hypergraphs.

Waiter-Client winner can be computed in polynomial time for fixed k.

Polynomial-time algorithm for rank 3 hypergraphs with NP oracle.

Abstract

Positional games were introduced by Hales and Jewett in 1963, and their study became more popular after Erdos and Selfridge's first result on their connection to Ramsey theory and hypergraph coloring in 1973. Several conventions of these games exist, and the most popular one, Maker-Breaker was proved to be PSPACE-complete by Schaefer in 1978. The study of their complexity then stopped for decades, until 2017 when Bonnet, Jamain, and Saffidine proved that Maker-Breaker is W[1]-complete when parameterized by the number of moves. The study was then intensified when Rahman and Watson improved Schaefer's result in 2021 by proving that the PSPACE-hardness holds for 6-uniform hypergraphs. More recently, Galliot, Gravier, and Sivignon proved that computing the winner on rank 3 hypergraphs is in P. We focus here on the Client-Waiter and the Waiter-Client conventions. Both were proved to be NP-hard by Csernenszky, Martin, and Pluh\'ar in 2011, but neither completeness nor positive results were known for these conventions. In this paper, we complete the study of these conventions by proving that the former is PSPACE-complete, even restricted to 6-uniform hypergraphs, and by providing an FPT-algorithm for the latter, parameterized by the size of its largest edge. In particular, the winner of Waiter-Client can be computed in polynomial time in k-uniform hypergraphs for any fixed integer k. Finally, in search of finding the exact bound between the polynomial result and the hardness result, we focused on the complexity of rank 3 hypergraphs in the Client-Waiter convention. We provide an algorithm that runs in polynomial time with an oracle in NP.