Abstract
A two-player game is sparse if most of its payoff entries are zeros. We show that the problem of computing a Nash equilibrium remains PPAD-hard to approximate in fully polynomial time for sparse games. On the algorithmic side, we give a simple and polynomial-time algorithm for finding exact Nash equilibria in a class of sparse win-lose games.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Goldberg, P., Papadimitriou, C.: Reducibility among equilibrium problems. In: STOC 2006 (2006)
Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a nash equilibrium. In: STOC 2006 (2006)
Papadimitriou, C.: On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 498–532 (1994)
Chen, X., Deng, X.: 3-nash is ppad-complete. In: ECCC, TR05-134 (2005)
Daskalakis, C., Papadimitriou, C.: Three-player games are hard. In: ECCC, TR05-139 (2005)
Chen, X., Deng, X.: Settling the complexity of two-player nash-equilibrium. In: FOCS 2006 (2006)
Chen, X., Deng, X., Teng, S.H.: Computing nash equilibria: Approximation and smoothed complexity. In: FOCS 2006 (2006)
Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple strategies. In: ACM EC 2003, pp. 36–41 (2003)
Spielman, D.A., Teng, S.H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51, 385–463 (2004)
Barany, I., Vempala, S., Vetta, A.: Nash equilibria in random games. In: FOCS 2005 (2005)
Chen, X., Teng, S.H., Valiant, P.A.: The approximation complexity of win-lose games. Tsinghua-BU-MIT (manuscript, 2006)
Nash, J.: Equilibrium point in n-person games. Proceedings of the National Academy of the USA 36, 48–49 (1950)
Codenotti, B., Leoncini, M., Resta, G.: Efficient computation of nash equilibria for very sparse win-lose bimatrix games. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 232–243. 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
Chen, X., Deng, X., Teng, SH. (2006). Sparse Games Are Hard. 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_24
Download citation
DOI: https://doi.org/10.1007/11944874_24
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)