Abstract
In this paper, we implement automatic procedures to enumerate all Nash maximal subsets of a bimatrix game and compute their dimensions. We propose a linear programming approach to identify extreme perfect Nash equilibria, enumerate all Selten maximal subsets and compute their dimensions. We present the Eχ-MIPerfect and the EEE-Perfect algorithms which enumerate all extreme perfect Nash equilibria. We finally report and comment computational experiments on randomly generated bimatrix games with different size and density.
Article PDF
Similar content being viewed by others
References
Audet C., Hansen P., Jaumard B., Savard G.: Enumeration of all extreme equilibrium strategies of bimatrix games. SIAM J. Sci. Comput. 23(1), 323–338 (2001)
Audet C., Belhaiza S., Hansen P.: Enumeration of all extreme equilibria in game theory: bimatrix and polymatrix games. J. Optim. Theory Appl. 129(3), 349–372 (2006)
Audet C., Belhaiza S., Hansen P.: A new sequence form approach for the enumeration and refinement of all extreme Nash equilibria for extensive form games. Int. Game Theory Rev. 11(4), 437–451 (2009)
Avis D., Rosenberg G.D., Savani R., von Stengel B.: Enumeration of Nash equilibria for two-player games. Econ. Theory 42, 9–37 (2010)
Belhaiza S., Audet C., Hansen P.: On proper refinement of Nash equilibria for bimatrix games. Automatica, 48, 297–303 (2012)
Borm P.E.M., Jansen M.J.M., Potters J.A.M., Tijs S.H.: On the structure of the set of perfect equilibria in bimatrix games. O-R Spektrum 15, 17–20 (1993)
Bron C., Kerbosch J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–579 (1973)
Heuer G.A., Millham C.B.: On Nash subsets ad mobility chains in bimatrix games. Naval Search Logist. Q. 23, 311–319 (1976)
Jansen M.J.M.: Maximal Nash subsets for bimatrix games. Naval Search Logist. Q. 28(1), 147–152 (1981)
Mangasarian O.L.: Equilibrium points of bimatrix games. J. Soc. Ind. Appl. Math. 12, 778–780 (1964)
Mangasarian O.L., Stone H.: Two person nonzero-sum games and quadratic programming. J. Math. Anal. Appl. 9, 348–355 (1964)
Millham C.B.: On Nash subsets of bimatrix games. Naval Res. Logist. Q. 74, 307–317 (1974)
Mills H.: Equilibrium points in finite games. J. Soc. Ind. Appl. Math. 8, 397–402 (1960)
Myerson, R.B.: Game Theory: Analysis of Conflict. Harvard University Press, Cambridge, London (1997)
Nash J.F.: Equilibrium points in n-person games. Proc. Natl. Acad. Sci. 36, 48–49 (1950)
Pardalos, P.M.; Migdalas, A.; Pitsoulis, L.: Pareto Optimality, Game Theory and Equilibria. Springer Optimization and Its Applications, vol. 17 (2008)
Selten R.: Reexamination of the perfectness concept for equilibrium points in extensive games. Int. J. Game Theory 4, 25–55 (1975)
van Damme, E.E.C.: Refinements of the Nash Equilibrium Concept, Lecture Notes in Economics and Mathematical Systems vol. 219. Springer, Berlin Heidelberg, New York (1983)
Von Stengel B., Van Den Elzen A., Talman D.: Computing normal form perfect equilibria for extensive two-person games. Econometrica, 70, 693–715 (2002)
Vorob’ev, N.N.: Equilibrium points in bimatrix games. Theoriya Veroyatnostej i ee Primwneniya, 3, 297–309 (1958). [English version: Theory of Probability and its Applications, 3, 297–309 (1958)]
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
This article is published under license to BioMed Central Ltd. Open Access This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
About this article
Cite this article
Belhaiza, S., Audet, C. & Hansen, P. A note on bimatrix game maximal Selten subsets. Arab. J. Math. 3, 299–311 (2014). https://doi.org/10.1007/s40065-014-0101-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40065-014-0101-x