The Complexity of Symmetric Bimatrix Games with Common Payoffs
<|reference_start|>The Complexity of Symmetric Bimatrix Games with Common Payoffs: We study symmetric bimatrix games that also have the common-payoff property, i.e., the two players receive the same payoff at any outcome of the game. Due to the symmetry property, these games are guaranteed to have symmetric Nash equilibria, where the two players play the same (mixed) strategy. While the problem of computing such symmetric equilibria in general symmetric bimatrix games is known to be intractable, namely PPAD-complete, this result does not extend to our setting. Indeed, due to the common-payoff property, the problem lies in the lower class CLS, ruling out PPAD-hardness. In this paper, we show that the problem remains intractable, namely it is CLS-complete. On the way to proving this result, as our main technical contribution, we show that computing a Karush-Kuhn-Tucker (KKT) point of a quadratic program remains CLS-hard, even when the feasible domain is a simplex.<|reference_end|>
@article{ghosh2024the,
    title={The Complexity of Symmetric Bimatrix Games with Common Payoffs},
    author={Abheek Ghosh and Alexandros Hollender},
    journal={arXiv preprint arXiv:2410.08031},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.08031},
    primaryClass={cs.GT cs.CC}
}