Query complexity of approximate Nash equilibria
From MaRDI portal
Publication:3177813
DOI10.1145/2908734zbMATH Open1407.91016OpenAlexW2531325587MaRDI QIDQ3177813FDOQ3177813
Authors: Yakov Babichenko 
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
Recommendations
- Query complexity of approximate nash equilibria
- scientific article; zbMATH DE number 6866347
- Query complexity of approximate equilibria in anonymous games
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- Logarithmic query complexity for approximate Nash computation in large games
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Noncooperative games (91A10) (n)-person games, (n>2) (91A06)
Cited In (11)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Title not available (Why is that?)
- Query complexity of approximate nash equilibria
- An abstraction-refinement methodology for reasoning about network games
- Optimally Deceiving a Learning Leader in Stackelberg Games
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
- Lower bounds for the query complexity of equilibria in Lipschitz games
- Learning convex partitions and computing game-theoretic equilibria from best response queries
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Lower bounds for the query complexity of equilibria in Lipschitz games
This page was built for publication: Query complexity of approximate Nash equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177813)
