Query Complexity of Approximate Nash Equilibria
From MaRDI portal
Publication:3177813
DOI10.1145/2908734zbMath1407.91016OpenAlexW2531325587MaRDI QIDQ3177813
Publication date: 2 August 2018
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2908734
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
An abstraction-refinement methodology for reasoning about network games ⋮ Lower bounds for the query complexity of equilibria in Lipschitz games ⋮ Learning convex partitions and computing game-theoretic equilibria from best response queries ⋮ Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds ⋮ Lower bounds for the query complexity of equilibria in Lipschitz games ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria ⋮ Optimally Deceiving a Learning Leader in Stackelberg Games
This page was built for publication: Query Complexity of Approximate Nash Equilibria
