A Note on Four-Players Triple Game

Authors

  • Rentsen Enkhbat National University of Mongolia
  • Sukhee Batbileg National University of Mongolia
  • Anton Anikin Matrosov Institute for System Dynamics and Control Theory of Siberian Branch of Russian Academy of Sciences
  • Natsagdorj Tungalag National University of Mongolia

Abstract

We introduce so-called four-players triple game and define Nash equilibrium. The problem of numerical finding of a Nash equilibrium in a four-players triple game has been examined. Such a game can be completely described by twelve matrices, and it turns out to be equivalent to the solving a nonconvex optimization problem. Special methods of local and global search for the optimization problem are proposed. The proposed algorithm was implemented on test problems by "GAMUT" (http: gamut.stanford.edu).

Keywords:

nonconvex optimization, four-players triple game, local and global search algorithm, Nash equilibrium

Downloads

Download data is not yet available.

References

Strekalovsky, A.S. and Enkhbat, R. (2014). Polymatrix games and optimization problems. Automation and Remote Control, 75(4), 632–645.

Orlov, A.V., Strekalovsky, A.S. and Batbileg, S. (2014). On computational search for Nash equilibrium in hexamatrix games. Optimization Letters, 10(2), 369–381.

Gornov, A., Zarodnyuk, T. (2014). Computing technology for estimation of convexity degree of the multiextremal funcion. Machine learning and data analysis, 10(1), 1345–1353.

Yanovskaya, E.B. (1968). Equilibrium points in polymatrix games (in Russian). Latv. Math. Collect., 8, 381–384.

Enkhbat, R., Batbileg, S., Gornov, A., Anikin, A., Tungalag, N. (2017). A Computational Method for Solving N-Person Game. IIGU Ser. Matematika, 20, 109–121 (Mi iigum308).

Strekalovsky, A.S. (1998). Global Optimality Conditions for Nonconvex Optimization. Journal of Global Optimization, 12, 415–434.

Enkhbat, R., Tungalag, N., Gornov, A., Anikin, A. (2016). The Curvilinear Search Algorithm for Solving Three-Person Game. Pro. DOOR 2016. CEUR-WS. 2016. 1623, 574-583. http://ceur-ws.org/Vol-1623/paperme4.pdf.

Gornov, A., Zarodnyuk, T. (2014) Computing technology for estimation of convexity degree of the multiextremal function. Machine learning and data analysis, 10(1), 1345–1353. http://jmlda.org

Mangasarian, O.L. and Stone, H. (1964). Two-Person Nonzero Games and Quadratic Programming. J. Mathemat. Anal. Appl., 9, 348–355.

Mills, H. (1960). Equilibrium Points in Finite Games. J. So. Indust. Appl. Mathemat., 8(2), 397–402.

Von Neumann, J., Morgenstern, O. (1944). Theory of games and economic.

Melvin Dresher (1981). The Mathematics of Games of Strategy. Dover Publications.

Vorobyev, N.N. (1984). Noncooperative games. Nauka.

Germeyer, YU.B. (1976). Introduction to Operation Reseach. Nauka.

Strekalovsky, A.S and Orlov, A.V. (2007). Bimatrix Game and Bilinear Programming. Nauka.

Owen, G. (1971). Game Theory. Saunders, Philadelphia.

Gibbons, R. (1992). Game Theory for Applied Economists. Princeton University, Press.

Horst, R. and Tuy, H. (1993). Global Optimization. Springer-Verlag.

Howson, J.T. (1972). Equilibria of Polymatrix Games. Management Sci 18, 312–318.

GAMUT is a site of game generators. http://gamut.stanford.edu

Downloads

Published

2022-02-16

How to Cite

Enkhbat, R., Batbileg, S., Anikin, A., & Tungalag, N. (2022). A Note on Four-Players Triple Game. Contributions to Game Theory and Management, 12. Retrieved from https://gametheory.spbu.ru/article/view/12893

Issue

Section

Articles