conftrace_

polymatrix game

8 papers

Explore in graph

Co-occurring keywords · papers mentioning both

nash equilibrium (6) zero-sum game (2) computational complexity (2) game theory (2) singleton game (1) graphical game (1) nash equilibrium approximation (1) win-lose game (1) gradient play (1) mixed-strategy nash equilibrium (1)

Papers

Computing Exact Nash Equilibria in Graphical Games: A Geometric Approach to Paths, Stars, and Caterpillars UAI 2026 The Complexity of Two-Team Polymatrix Games with Independent Adversaries ICLR 2025 Asynchronous Gradient Play in Zero-Sum Multi-agent Games ICLR 2023 Complexity of Efficient Outcomes in Binary-Action Polymatrix Games and Implications for Coordination Problems IJCAI 2023 Guarantees for Self-Play in Multiplayer Games via Polymatrix Decomposability NeurIPS 2023 On the Approximation of Nash Equilibria in Sparse Win-Lose Multi-player Games AAAI 2021 Leadership in Singleton Congestion Games IJCAI 2018 Learning Sparse Polymatrix Games in Polynomial Time and Sample Complexity AISTATS 2018