Lipschitz Continuity and Approximate Equilibria

DOI10.1007/978-3-662-53354-3_2zbMath1403.91076arXiv1509.02023OpenAlexW2320618127MaRDI QIDQ2819444

John Fearnley, Argyrios Deligkas, Paul G. Spirakis

Publication date: 29 September 2016

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.02023

zbMATH Keywords

Lipschitz continuityconcave gamesapproximate equilibria algorithm

Mathematics Subject Classification ID

2-person games (91A05) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04) Spaces of games (91A70)

Related Items (3)

Equilibrium computation in resource allocation games ⋮ Approximating the existential theory of the reals ⋮ Approximating the existential theory of the reals

Cites Work

• Stability in large Bayesian games with heterogeneous players
• 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
• When the Players Are Not Expectation Maximizers
• Settling the complexity of computing two-player Nash equilibria
• An Optimization Approach for Approximate Nash Equilibria
• Lipschitz Games
• The Complexity of Computing a Nash Equilibrium
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games

This page was built for publication: Lipschitz Continuity and Approximate Equilibria