On nash-equilibria of approximation-stable games

  • Authors:

  • Pranjal Awasthi;Maria-Florina Balcan;Avrim Blum;Or Sheffet;Santosh Vempala

  • Affiliations:

  • Carnegie Mellon University, Pittsburgh, Pennsylvania;Georgia Institute of Technology, Atlanta, Georgia;Carnegie Mellon University, Pittsburgh, Pennsylvania;Carnegie Mellon University, Pittsburgh, Pennsylvania;Georgia Institute of Technology, Atlanta, Georgia

  • Venue:
  • SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are far apart, or ε-equilibria that are far in variation distance from the true Nash equilibrium strategies, then this prediction may not be possible even in principle. Motivated by this consideration, in this paper we define the notion of games that are approximation stable, meaning that all ε-approximate equilibria are contained inside a small ball of radius Δ around a true equilibrium, and investigate a number of their properties. Many natural small games such as matching pennies and rock-paper-scissors are indeed approximation stable. We show furthermore there exist 2-player n-by-n approximationstable games in which the Nash equilibrium and all approximate equilibria have support Ω(log n). On the other hand, we show all (ε,Δ) approximation-stable games must have an ε-equilibrium of support O(Δ2-o(1)/ε2 log n), yielding an immediate nO(Δ2-o(1)/ε2 log n) -time algorithm, improving over the bound of [11] for games satisfying this condition. We in addition give a polynomial-time algorithm for the case that Δ and ε are sufficiently close together. We also consider an inverse property, namely that all non-approximate equilibria are far from some true equilibrium, and give an efficient algorithm for games satisfying that condition.