Reducibility among equilibrium problems
From MaRDI portal
Publication:2931370
DOI10.1145/1132516.1132526zbMath1301.68161OpenAlexW2125413339MaRDI QIDQ2931370
Paul W. Goldberg, Christos H. Papadimitriou
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132526
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Games involving graphs (91A43)
Related Items (17)
A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium ⋮ On the complexity of constrained Nash equilibria in graphical games ⋮ Computing equilibria: a computational complexity perspective ⋮ Random bimatrix games are asymptotically easy to solve (a simple proof) ⋮ From Duels to Battlefields: Computing Equilibria of Blotto and Other Games ⋮ Action-graph games ⋮ Equilibria of graphical games with symmetries ⋮ Parameterized two-player Nash equilibrium ⋮ Unnamed Item ⋮ The complexity of uniform Nash equilibria and related regular subgraph problems ⋮ Approximate equilibria in strongly symmetric games ⋮ Well supported approximate equilibria in bimatrix games ⋮ Imitation games and computation ⋮ Approximate Equilibria for Strategic Two Person Games ⋮ A note on approximate Nash equilibria ⋮ New algorithms for approximate Nash equilibria in bimatrix games ⋮ Polynomial-time computation of exact correlated equilibrium in compact games
This page was built for publication: Reducibility among equilibrium problems
