scientific article; zbMATH DE number 6866347
From MaRDI portal
Publication:4638112
Recommendations
- Query complexity of approximate Nash equilibria
- Query complexity of approximate nash equilibria
- Logarithmic query complexity for approximate Nash computation in large games
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- On the complexity of approximating a Nash equilibrium
- scientific article; zbMATH DE number 6783488
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- Query complexity of approximate equilibria in anonymous games
- Query complexity of approximate equilibria in anonymous games
- Approximation and characterization of Nash equilibria of large games
Cites work
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- A size-free CLT for Poisson multinomials and its applications
- Adaptive Heuristics
- An optimization approach for approximate Nash equilibria
- Approximate Nash equilibria in anonymous games
- Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carathéodory's theorem
- Computing correlated equilibria in multi-player games
- Constant rank bimatrix games are PPAD-hard
- Equilibrium points in n -person games
- From external to internal regret
- Inapproximability of Nash equilibrium
- Learning equilibria of games via payoff queries
- Nash equilibria in random games
- On the Complexity of Nash Equilibria and Other Fixed Points
- On the complexity of Nash equilibria in anonymous games
- Playing anonymous games using simple strategies
- Query complexity of approximate equilibria in anonymous games
- Query complexity of approximate nash equilibria
- Settling the complexity of computing two-player Nash equilibria
- The complexity of computing a Nash equilibrium
- The Fourier transform of Poisson multinomial distributions and its algorithmic applications
- The Nash equilibrium: A perspective
- The query complexity of correlated equilibria
Cited in
(8)- Lower bounds for the query complexity of equilibria in Lipschitz games
- Logarithmic Query Complexity for Approximate Nash Computation in Large Games
- Query complexity of approximate Nash equilibria
- Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
- Optimally Deceiving a Learning Leader in Stackelberg Games
- Query complexity of approximate nash equilibria
- 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4638112)
