On Nash-equilibria of approximation-stable games

DOI10.1007/978-3-642-16170-4_8MaRDI QIDQ3162509zbMATH OpenOpenAlexFDO

Authors Pranjal Awasthi, Maria-Florina Balcan, Or Sheffet, Avrim Blum, Santosh S. Vempala

Publication date 19 October 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-16170-4_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10)

Recommendations

• Nash equilibria in perturbation-stable games
• A note on approximate Nash equilibria
• Approximate Nash Equilibria for Multi-player Games
• Polynomial algorithms for approximating Nash equilibria of bimatrix games
• On the complexity of approximating a Nash equilibrium

Cites work

• Nash equilibria in random games
• New algorithms for approximate Nash equilibria in bimatrix games
• On the Complexity of Nash Equilibria and Other Fixed Points
• The complexity of computing a Nash equilibrium

Cited in

(14)

• A note on approximate Nash equilibria
• On games without approximate equilibria
• Uniformly supported approximate equilibria in families of games
• Approximation and characterization of Nash equilibria of large games
• On some approaches to find Nash equilibrium in concave games
• Approximate solutions and Tikhonov well-posedness for Nash equilibria
• Remarks on the existence and stability of some relaxed Nash equilibrium in strategic form games
• Empirical distribution of equilibrium play and its testing application
• Computing Simply Stable Equilibria
• Nash equilibria in perturbation-stable games
• Data stability in clustering: a closer look
• On the Performances of Nash Equilibria in Isolation Games
• Approximate Nash Equilibria for Multi-player Games
• Approximations of Nash equilibria

This page was built for publication: On Nash-equilibria of approximation-stable games

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