Query complexity of approximate Nash equilibria
From MaRDI portal
Publication:3177813
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
Cited in
(15)- Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- Lower bounds for the query complexity of equilibria in Lipschitz games
- Empirical distribution of equilibrium play and its testing application
- Learning equilibria of games via payoff queries
- Logarithmic query complexity for approximate Nash computation in large games
- An abstraction-refinement methodology for reasoning about network games
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Lower bounds for the query complexity of equilibria in Lipschitz games
- Query complexity of approximate nash equilibria
- Optimally Deceiving a Learning Leader in Stackelberg Games
- Query complexity of approximate equilibria in anonymous games
- Learning convex partitions and computing game-theoretic equilibria from best response queries
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- scientific article; zbMATH DE number 6866347 (Why is no real title available?)
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
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)