Lipschitz continuity and approximate equilibria
From MaRDI portal
Publication:2006946
DOI10.1007/s00453-020-00709-3zbMath1455.91064OpenAlexW3019968657MaRDI QIDQ2006946
John Fearnley, Argyrios Deligkas, Paul G. Spirakis
Publication date: 12 October 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-020-00709-3
2-person games (91A05) Computational methods for problems pertaining to game theory, economics, and finance (91-08) Spaces of games (91A70) Algorithmic game theory and complexity (91A68)
Related Items (2)
Lower bounds for the query complexity of equilibria in Lipschitz games ⋮ Lower bounds for the query complexity of equilibria in Lipschitz games
Cites Work
- The complexity of equilibria for risk-modeling valuations
- Approximate well-supported Nash equilibria below two-thirds
- Computing approximate Nash equilibria in polymatrix games
- Distributed methods for computing approximate equilibria
- Stability in large Bayesian games with heterogeneous players
- Well supported approximate equilibria in bimatrix games
- A note on approximate Nash equilibria
- New algorithms for approximate Nash equilibria in bimatrix games
- Approximate Nash equilibria in anonymous games
- Best-reply dynamics in large binary-choice anonymous games
- Non-cooperative games
- Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem
- On the Complexity of Nash Equilibria and Other Fixed Points
- When the Players Are Not Expectation Maximizers
- Settling the complexity of computing two-player Nash equilibria
- An Optimization Approach for Approximate Nash Equilibria
- The polynomial solvability of convex quadratic programming
- Lipschitz Games
- The Complexity of Computing a Nash Equilibrium
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Approximating the existential theory of the reals
This page was built for publication: Lipschitz continuity and approximate equilibria
