Abstract
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Althofer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications 199 (1994)
Caccetta, L., Haggkvist, R.: On minimal digraphs with given girth. Congressus Numerantium XXI (1978)
Charbit, P.: Circuits in graphs and digraphs via embeddings. Doctoral dissertation, University of Lyon I (2005)
Chen, X., Deng, X.: Settling the complexity of two-player nash equilibrium. In: FOCS (2006)
Chen, X., Deng, X., Teng, S.-H.: Computing nash equilibria:approximation and smoothed complexity. In: ECCC (2006)
Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a nash equilibrium. In: STOC (2006)
Goldberg, P., Papadimitriou, C.: Reducibility among equilibrium problems. In: STOC (2006)
Lipton, R., Markakis, E., Mehta, A.: Playing large games using simple strategies. ACM Electronic Commerce (2003)
Myers, J.S.: Extremal theory of graph minors and directed graphs. Doctoral dissertation (2003)
Kontogiannis, S.C., Panagopoulou, P.N., Spirakis, P.G.: WINE 2006. LNCS, vol. 4286. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daskalakis, C., Mehta, A., Papadimitriou, C. (2006). A Note on Approximate Nash Equilibria. In: Spirakis, P., Mavronicolas, M., Kontogiannis, S. (eds) Internet and Network Economics. WINE 2006. Lecture Notes in Computer Science, vol 4286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11944874_27
Download citation
DOI: https://doi.org/10.1007/11944874_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68138-0
Online ISBN: 978-3-540-68141-0
eBook Packages: Computer ScienceComputer Science (R0)