Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.07398 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910117569495040 |
|---|---|
| author | Hollender, Alexandros Maystre, Gilbert Nagarajan, Sai Ganesh |
| author_facet | Hollender, Alexandros Maystre, Gilbert Nagarajan, Sai Ganesh |
| contents | 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 (i.e., CLS-membership) for the setting where one of the teams consists of multiple independent adversaries. By leveraging this result we also obtain a simple algorithm that finds an $\varepsilon$-Nash equilibrium and only has a $1/\varepsilon^2$ dependence in $\varepsilon$ in its running time. 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_07398 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The Complexity of Two-Team Polymatrix Games with Independent Adversaries Hollender, Alexandros Maystre, Gilbert Nagarajan, Sai Ganesh Computer Science and Game Theory 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 (i.e., CLS-membership) for the setting where one of the teams consists of multiple independent adversaries. By leveraging this result we also obtain a simple algorithm that finds an $\varepsilon$-Nash equilibrium and only has a $1/\varepsilon^2$ dependence in $\varepsilon$ in its running time. 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. |
| title | The Complexity of Two-Team Polymatrix Games with Independent Adversaries |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2409.07398 |