On Nash-Equilibria of Approximation-Stable Games

DOI10.1007/978-3-642-16170-4_8zbMath1310.91009OpenAlexW3136466262MaRDI QIDQ3162509

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

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)

Related Items (1)

Data stability in clustering: a closer look

Cites Work

• 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
• Nash equilibria in random games

This page was built for publication: On Nash-Equilibria of Approximation-Stable Games