On the Complexity of Approximating a Nash Equilibrium
From MaRDI portal
Publication:2933653
DOI10.1145/2483699.2483703zbMath1301.91001OpenAlexW2126211987MaRDI QIDQ2933653
Publication date: 5 December 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/73096
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) 2-person games (91A05) Approximation algorithms (68W25)
Related Items (10)
Inapproximability of Nash Equilibrium ⋮ Approximating Nash Equilibria in Tree Polymatrix Games ⋮ Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem ⋮ Learning Stationary Nash Equilibrium Policies in \(n\)-Player Stochastic Games with Independent Chains ⋮ Unnamed Item ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ Equilibrium paths in discounted supergames ⋮ Computing approximate Nash equilibria in polymatrix games ⋮ Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution ⋮ Semidefinite Programming and Nash Equilibria in Bimatrix Games
This page was built for publication: On the Complexity of Approximating a Nash Equilibrium
