Abstract
We focus on the problem of computing approximate Nash equilibria and well-supported approximate Nash equilibria in random bimatrix games, where each player’s payoffs are bounded and independent random variables, not necessarily identically distributed, but with common expectations. We show that the completely mixed uniform strategy profile, i.e. the combination of mixed strategies (one per player) where each player plays with equal probability each one of her available pure strategies, is with high probability a \(\sqrt{\frac{\ln n}{n}}\)-Nash equilibrium and a \(\sqrt{\frac{3\ln n}{n}}\)-well supported Nash equilibrium, where n is the number of pure strategies available to each player. This asserts that the completely mixed, uniform strategy profile is an almost Nash equilibrium for random bimatrix games, since it is, with high probability, an ε-well-supported Nash equilibrium where ε tends to zero as n tends to infinity.
This work has been partially supported by the European Union under contract numbers ICT-2008-215270 (FRONTS), ICT-2009-5-257782 (ABC4Trust), and ERC/StG-210743 (RIMACO).
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
Althöfer, I.: On sparse approximations to randomized strategies and convex combinations. Linear Algebra and Applications 199, 339–355 (1994)
Bárány, I., Vempala, S., Vetta, A.: Nash equilibria in random games. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 123–131 (2005)
Chen, X., Deng, X.: Settling the complexity of 2-player Nash-equilibrium. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006 (2005)
Chen, X., Deng, X., Teng, S.-H.: Computing Nash equilibria: Approximation and smoothed complexity. In: Electronic Colloquium on Computational Complexity, ECCC (2006)
Daskalakis, C., Goldberg, P., Papadimitriou, C.: The complexity of computing a Nash equilibrium. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC 2006), pp. 71–78 (2006)
Daskalakis, C., Papadimitriou, C.: Three-player games are hard. In: Electronic Colloquium on Computational Complexity, ECCC (2005)
Goldberg, P., Papadimitriou, C.: Reducibility among equilibrium problems. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC 2006), pp. 61–70 (2006)
Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58, 13–30 (1963)
Lemke, C.E.: Bimatrix equilibrium points and mathematical programming. Management Science 11, 681–689 (1965)
Lemke, C.E., Howson, J.T.: Equilibrium points of bimatrix games. J. Soc. Indust. Appl. Math. 12, 413–423 (1964)
Lipton, R.J., Markakis, E., Mehta, A.: Playing large games using simple startegies. In: Proceedings of the 4th ACM Conference on Electronic Commerce (EC 2003), pp. 36–41 (2003)
Nash, J.: Noncooperative games. Annals of Mathematics 54, 289–295 (1951)
Papadimitriou, C.H.: On inefficient proofs of existence and complexity classes. In: Proceedings of the 4th Czechoslovakian Symposium on Combinatorics (1991)
Savani, R., von Stengel, B.: Exponentially many steps for finding a nash equilibrium in a bimatrix game. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004), pp. 258–267 (2004)
Tsaknakis, H., Spirakis, P.G.: An optimization approach for approximate Nash equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 42–56. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Panagopoulou, P.N., Spirakis, P.G. (2011). Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). In: Persiano, G. (eds) Algorithmic Game Theory. SAGT 2011. Lecture Notes in Computer Science, vol 6982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24829-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-24829-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24828-3
Online ISBN: 978-3-642-24829-0
eBook Packages: Computer ScienceComputer Science (R0)