Lipschitz Games

DOI10.1287/moor.1120.0557zbMath1297.91006arXiv1107.1520OpenAlexW2913334655MaRDI QIDQ5169667

Eran Shmaya, Yaron Azrieli

Publication date: 11 July 2014

Published in: Mathematics of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

large gamespurificationpure equilibriumLipschitz games

Mathematics Subject Classification ID

Noncooperative games (91A10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (18)

Large strategic dynamic interactions ⋮ The Lipschitz constant of perturbed anonymous games ⋮ Query Complexity of Approximate Equilibria in Anonymous Games ⋮ Symmetry and approximate equilibria in games with countably many players ⋮ Query complexity of approximate equilibria in anonymous games ⋮ Lower bounds for the query complexity of equilibria in Lipschitz games ⋮ PPAD-complete approximate pure Nash equilibria in Lipschitz games ⋮ Stability in large Bayesian games with heterogeneous players ⋮ PPAD-complete pure approximate Nash equilibria in Lipschitz games ⋮ Logarithmic query complexity for approximate Nash computation in large games ⋮ Ex-post stability of Bayes-Nash equilibria of large games ⋮ Approximate Nash equilibria in anonymous games ⋮ Lipschitz continuity and approximate equilibria ⋮ Lower bounds for the query complexity of equilibria in Lipschitz games ⋮ Fast Convergence of Best-Reply Dynamics in Aggregative Games ⋮ Logarithmic Query Complexity for Approximate Nash Computation in Large Games ⋮ Lipschitz Continuity and Approximate Equilibria ⋮ On the uniqueness of quantal response equilibria and its application to network games

This page was built for publication: Lipschitz Games