Lipschitz continuity and approximate equilibria

DOI10.1007/S00453-020-00709-3MaRDI QIDQ2006946zbMATH OpenOpenAlexFDO

Authors Argyrios Deligkas, John Fearnley, P. G. Spirakis

Publication date 12 October 2020

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00453-020-00709-3

zbMATH Keywords

approximate equilibriabiased gamesLipschitz gamespenalty games

Mathematics Subject Classification ID

Computational methods for problems pertaining to game theory, economics, and finance (91-08) 2-person games (91A05) Algorithmic game theory and complexity (91A68) Spaces of games (91A70)

Recommendations

• Lipschitz continuity and approximate equilibria
• Lipschitz continuity of an approximate solution mapping to equilibrium problems
• Lipschitz extensions and approximations
• scientific article; zbMATH DE number 1828034
• Lipschitz continuity of approximate solution mappings to parametric generalized vector equilibrium problems
• On approximation of continuous functions in Lipschitz norms
• Lipschitz continuity of an approximate solution mapping for parametric set-valued vector equilibrium problems
• scientific article; zbMATH DE number 3925251
• scientific article; zbMATH DE number 2100858
• Lipschitz continuity of convex functions

Cites work

• A note on approximate Nash equilibria
• 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
• Approximating the existential theory of the reals
• Best-reply dynamics in large binary-choice anonymous games
• Computing approximate Nash equilibria in polymatrix games
• Distributed methods for computing approximate equilibria
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• Lipschitz games
• New algorithms for approximate Nash equilibria in bimatrix games
• Non-cooperative games
• On the Complexity of Nash Equilibria and Other Fixed Points
• Settling the complexity of computing two-player Nash equilibria
• Stability in large Bayesian games with heterogeneous players
• The complexity of computing a Nash equilibrium
• The complexity of equilibria for risk-modeling valuations
• The polynomial solvability of convex quadratic programming
• Well supported approximate equilibria in bimatrix games
• When the players are not expectation maximizers

Cited in

(10)

• Equivalence between Wadge and Lipschitz determinacy
• Lower bounds for the query complexity of equilibria in Lipschitz games
• Lipschitz continuity and approximate equilibria
• scientific article; zbMATH DE number 5657307 (Why is no real title available?)
• Lipschitz continuity of an approximate solution mapping to equilibrium problems
• scientific article; zbMATH DE number 2112021 (Why is no real title available?)
• scientific article; zbMATH DE number 786222 (Why is no real title available?)
• Lipschitz games
• Lower bounds for the query complexity of equilibria in Lipschitz games
• Smooth equilibrium measures and approximation

This page was built for publication: Lipschitz continuity and approximate equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2006946)