Abstract
The effectiveness of using the local search algorithm (mountain climbing) and the Lemke–Howson method for searching for Nash equilibrium in 4-person games in general and multi-matrix settings using the Matlab, Python, and FORTRAN software environments are studied. The local search procedure implemented in the Python environment, involving the use of multiplication of a multi-dimensional matrix by a vector, turned out to be an effective tool. The modification of the Lemke–Howson method for multi-matrix formulation showed very good results.
The work was supported by the Russian Foundation for Basic Research (project No. 20-010-00169a).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Batbileg, S., Tungalag, N., Anikin, A., Gornov, A., Finkelstein, E.: A global optimization algorithm for solving a four-person game. Optim. Lett. 13(3), 587–596 (2017). https://doi.org/10.1007/s11590-017-1181-2
Enkhbat, R., Bathileg, S., Anikin, A., Tungalag, N., Gornov, A.: A note on four-players triple game. Contrib. Game Theory Manag. 12, 100–112 (2019)
Golshtein, E.: A numerical method for solving finite three-person games. Economica i Matematicheskie Metody 50(1), 110–116 (2014). (in Russian)
Golshtein, E., Malkov, U., Sokolov, N.: The Lemke-Howson algorithm solving finite non-cooperative three-person games in a special setting. DEStech Trans. Comput. Sci. Eng. (optim) 265–272 (2018). https://doi.org/10.12783/dtcse/optim2018/27938. (Supplementary volume)
Konno, H.: A cutting plane algorithm for solving bilinear programs. Math. Program. 11(1), 14–27 (1976)
Lemke, C., Howson, C.: Equilibrium points of bimatrix games. J. Soc. Ind. Appl. Math. 12(2), 413–423 (1964)
Orlov, A., Strekalovsky, A., Batbileg, S.: On computational search for nash equilibrium in hexamatrix games. Optim. Lett. 10(2), 369–381 (2014)
Strekalovskii, A.S., Enkhbat, R.: Polymatrix games and optimization problems. Autom. Remote Control 75(4), 632–645 (2014). https://doi.org/10.1134/S0005117914040043
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Malkov, U., Malkova, V. (2020). Effectiveness of Nash Equilibrium Search Algorithms in Four-Person Games in General and Multi-matrix Settings. In: Olenev, N., Evtushenko, Y., Khachay, M., Malkova, V. (eds) Advances in Optimization and Applications. OPTIMA 2020. Communications in Computer and Information Science, vol 1340. Springer, Cham. https://doi.org/10.1007/978-3-030-65739-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-65739-0_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-65738-3
Online ISBN: 978-3-030-65739-0
eBook Packages: Computer ScienceComputer Science (R0)