Approximating Nash Equilibria in Tree Polymatrix Games

DOI10.1007/978-3-662-48433-3_22zbMath1358.91027arXiv1604.02676OpenAlexW2240016676MaRDI QIDQ3449601

Katrina Ligett, Siddharth Barman, Georgios Piliouras

Publication date: 4 November 2015

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.02676

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Approximation algorithms (68W25)

Related Items

Inapproximability of Nash Equilibrium, Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution, Approximating the existential theory of the reals, Approximating the existential theory of the reals

Cites Work

• Unnamed Item
• Unnamed Item
• A note on approximate Nash equilibria
• On the Complexity of Approximating a Nash Equilibrium
• Computing Approximate Nash Equilibria in Polymatrix Games
• Inapproximability of Nash Equilibrium
• Settling the complexity of computing two-player Nash equilibria
• The Complexity of Computing a Nash Equilibrium
• On a Network Generalization of the Minmax Theorem
• Equilibria of Polymatrix Games