Abstract
Nash equilibrium is one of the main concepts in the game theory. Recently it was shown, that problem of finding Nash equilibrium and an approximate Nash equilibrium is PPAD-complete. In this article we adapt Differential Evolution algorithm (DE) to the above problem. It may be classified as continuous problem, where two probability distributions over the set of pure strategies of both players should be found. Every deviation from the global optimum is interpreted as Nash approximation and called ε-Nash equilibrium. We show, that the Differential Evolution approach can be determined as iterative method, which in successive iterations is capable to obtain ε value close to the global optimum. The contribution of this paper is the experimental analysis of the proposed approach and indication of it’s strong features. We try to demonstrate, that the proposed method is very good alternative for the existing mathematical analysis of the mentioned Nash equilibrium problem.
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
Chen, X., Deng, X., Teng, S.-H.: Computing Nash Equilibria: Approximation and Smoothed Complexity. In: 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 603–612 (2006).
Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: 47th Symposium Foundations of Computer Science, pp. 261–271 (2006)
Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate Nash equilibria. Journal Theoretical Computer Science 410, 1581–1588 (2009)
Dickhaut, J., Kaplan, T.: A program for finding Nash equilibria, Working papers, University of Minnesota, Department of Economics (1991)
Etessami, K., Yannakakis, M.: On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 113–123 (2007)
Gilboa, I.: Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior 1, 80–93 (1989)
Hammerstein, P., Selten, R.: Handbook of game theory - Chapter Game theory and evolutionary biology. University of Bonn (1994)
Kontogiannis, S.C., Panagopoulou, P.N., Spirakis, P.G.: Polynomial algorithms for approximating Nash equilibria of bimatrix games. Journal Theoretical Computer Science 410, 1599–1606 (2009)
Lemke, C.E., Howson, J.T.: Equilibrium Points of Bimatrix Games. Society for Industrial and Applied Mathematics 12, 413–423 (1964)
Magoulas, G.D., Plagianakos, V.P., Vrahatis, M.N.: Neural Network-Based Colonoscopic Diagnosis using On-Line Learning and Differential Evolution. Applied Soft Computing 4, 369–379 (2004)
McKelvey, R.D., McLennan, A.M., Turocy, T.L.: Gambit: Software Tools for Game Theory, Version 0.2010.09.01 (2010), http://www.gambit-project.org
McLennan, A.: The Expected Number of Nash Equilibria of a Normal Form Game. Econometrica 73, 141–174 (2005)
Murugavel, A.K., Ranganathan, N.: A Game-Theoretic Approach for Binding in Behavioral Synthesis. In: 16th International Conference on VLSI Design, pp. 452–458 (2003)
Nash, J.F.: Non-cooperative games. Annals of Mathematics 54(2), 286–295 (1951)
Neel, J., Mackenzie, A., Menon, R., Dasilva, L., Hicks, J., Reed, G.J.R.: Using game theory to analyze wireless ad hoc networks. IEEE Communications Surveys & Tutorials 7(4), 46–56 (2005)
Nudelman, E., Wortman, J., Shoham, Y., Leyton-Brown, K.: Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms. In: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 2 (2004)
Ordeshook, P.: Game theory and political theory. Cambridge University Press, Cambridge (1986)
Pavlidis, N., Parsopoulos, K., Vrahatis, M.: Computing Nash Equilibria Through Computational Intelligence Methods. Journal of Computational and Applied Mathematics, 113–136 (2005)
Porter, R., Nudelman, E., Shoham, Y.: Simple Search Methods for Finding a Nash Equilibrium. Games and Economic Behavior 63, 642–662 (2008)
Sandholm, T., Gilpin, A., Conitzer, V.: Mixed-integer programming methods for finding Nash equilibria. In: Proceedings of the 20th National Conference on Artificial Intelligence, vol. 2, pp. 495–501 (2005)
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, pp. 258–267 (2004)
Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11(4), 341–359 (1997)
Storn, R.: Differential evolution design of an iir-Filter. In: IEEE International Conference on Evolutionary Computation ICEC 1996, pp. 268–273 (1996)
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
Boryczka, U., Juszczuk, P. (2011). Approximate Nash Equilibria in Bimatrix Games. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2011. Lecture Notes in Computer Science(), vol 6923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23938-0_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-23938-0_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23937-3
Online ISBN: 978-3-642-23938-0
eBook Packages: Computer ScienceComputer Science (R0)