Lower bounds for the query complexity of equilibria in Lipschitz games

DOI10.1016/j.tcs.2023.113931OpenAlexW3180370738MaRDI QIDQ6159025

Paul W. Goldberg, Matthew J. Katzman

Publication date: 1 June 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113931

zbMATH Keywords

Nash equilibriumquery complexityLipschitz games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
• The query complexity of correlated equilibria
• Logarithmic query complexity for approximate Nash computation in large games
• Lipschitz continuity and approximate equilibria
• Approximate Nash equilibria in anonymous games
• Query complexity of approximate equilibria in anonymous games
• Non-cooperative games
• Query Complexity of Approximate Nash Equilibria
• Lipschitz Games
• Fast Convergence of Best-Reply Dynamics in Aggregative Games
• PPAD-complete pure approximate Nash equilibria in Lipschitz games

This page was built for publication: Lower bounds for the query complexity of equilibria in Lipschitz games