The Complexity of Two-Team Polymatrix Games with Independent Adversaries
<|reference_start|>The Complexity of Two-Team Polymatrix Games with Independent Adversaries: Adversarial multiplayer games are an important object of study in multiagent learning. In particular, polymatrix zero-sum games are a multiplayer setting where Nash equilibria are known to be efficiently computable. Towards understanding the limits of tractability in polymatrix games, we study the computation of Nash equilibria in such games where each pair of players plays either a zero-sum or a coordination game. We are particularly interested in the setting where players can be grouped into a small number of teams of identical interest. While the three-team version of the problem is known to be PPAD-complete, the complexity for two teams has remained open. Our main contribution is to prove that the two-team version remains hard, namely it is CLS-hard. Furthermore, we show that this lower bound is tight for the setting where one of the teams consists of multiple independent adversaries. On the way to obtaining our main result, we prove hardness of finding any stationary point in the simplest type of non-convex-concave min-max constrained optimization problem, namely for a class of bilinear polynomial objective functions.<|reference_end|>
@article{hollender2024the,
    title={The Complexity of Two-Team Polymatrix Games with Independent Adversaries},
    author={Alexandros Hollender, Gilbert Maystre and Sai Ganesh Nagarajan},
    journal={arXiv preprint arXiv:2409.07398},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.07398},
    primaryClass={cs.GT}
}