A Note on Approximate Nash Equilibria
In view of the intractability of finding a Nash equilibrium, it is important to understand the limits of approximation in this context. A subexponential approximation scheme is known [LMM03], and no approximation better than \(1\over 4\) is possible by any algorithm that examines equilibria involving fewer than logn strategies [Alt94]. We give a simple, linear-time algorithm examining just two strategies per player and resulting in a \(1\over 2\)-approximate Nash equilibrium in any 2-player game. For the more demanding notion of well-supported approximate equilibrium due to [DGP06] no nontrivial bound is known; we show that the problem can be reduced to the case of win-lose games (games with all utilities 0–1), and that an approximation of \(5\over 6\) is possible contingent upon a graph-theoretic conjecture.
KeywordsNash Equilibrium Mixed Strategy Pure Strategy Original Game Normal Form Game
Unable to display preview. Download preview PDF.
- [Alt94]Althofer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications 199 (1994)Google Scholar
- [CH78]Caccetta, L., Haggkvist, R.: On minimal digraphs with given girth. Congressus Numerantium XXI (1978)Google Scholar
- [Cha05]Charbit, P.: Circuits in graphs and digraphs via embeddings. Doctoral dissertation, University of Lyon I (2005)Google Scholar
- [CD05]Chen, X., Deng, X.: Settling the complexity of two-player nash equilibrium. In: FOCS (2006)Google Scholar
- [CDT06]Chen, X., Deng, X., Teng, S.-H.: Computing nash equilibria:approximation and smoothed complexity. In: ECCC (2006)Google Scholar
- [DGP06]Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a nash equilibrium. In: STOC (2006)Google Scholar
- [GP06]Goldberg, P., Papadimitriou, C.: Reducibility among equilibrium problems. In: STOC (2006)Google Scholar
- [LMM03]Lipton, R., Markakis, E., Mehta, A.: Playing large games using simple strategies. ACM Electronic Commerce (2003)Google Scholar
- [Mye03]Myers, J.S.: Extremal theory of graph minors and directed graphs. Doctoral dissertation (2003)Google Scholar