Skip to main content
Log in

A global optimization algorithm for solving a four-person game

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The nonzero sum four-person game was considered. We show that the game can be reduced to a global optimization problem by extending Mills’ result (J Soc Ind Appl Math 8(2):397–402, 1960). For solving the problem, we propose a global optimization method that combines the ideas of the classical multistart and an estimation of a convexity degree of the function. The proposed algorithm was tested numerically on some problems created by the well-known generator GAMUT (GAMUT is a Suite of Game Generators. http://gamut.stanford.edu) and allowed us to find solutions to the four-person game.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. Von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)

    MATH  Google Scholar 

  2. Dresher, Melvin: The Mathematics of Games of Strategy. Dover Publications, New York (1981)

    MATH  Google Scholar 

  3. Germeyer, Y.U.B.: Introduction to Operation Reseach. Nauka, Moscow (1976)

    Google Scholar 

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

    Book  Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  7. Vorobyev, N.: Noncooperative Games. Nauka, Moscow (1984)

    Google Scholar 

  8. Pang, J.S.: Three modeling paradigms in mathematical programming. Math. Program. Ser. B. 125(2), 297–323 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. Panicucci, B., Pappalardo, M., Passacantando, M.: On solving generalized Nash equilibrium problems via optimization. Optim. Lett. 3, 419–435 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Altangerel, L., Battur, G.: Perturbation approach to generalized Nash equilibrium problems with shared constraints. Optim. Lett. 6, 1379–1391 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Mangasarian, O.L., Stone, H.: Two-person nonzero games and quadratic programming. J. Math. Anal. Appl. 9, 348–355 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  12. Strekalovsky, A.S.: Global optimality conditions for nonconvex optimization. J. Glob. Optim. 12, 415–434 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  13. Horst, R., Tuy, H.: Global Optimization. Springer, Berlin (1993)

    Book  MATH  Google Scholar 

  14. Porter, R., Nudelman, E., Shoham, Y.: Simple search methods for finding a Nash equilibrium. Game Econ. Behav. 63, 642–662 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Gilboa, I., Zemel, E.: Nash and correlated equilibria: some complexity considerations. Games Econ. Behav. 1, 80–93 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  16. Khachiyan, L.: A polynomial time algorithm for linear programming. Dokl. Akad. Nauk SSSR 244, 1093–1096 (1979)

    MathSciNet  MATH  Google Scholar 

  17. McKelvey, R., McLennan, A.: The maximal number of regular totally mixed Nash equilibria. J. Econ. Theory 72, 411425 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  18. 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 Multi Agent Systems (2004)

  19. Enkhbat, R., Tungalag, N., Gornov, A., Anikin, A.: The curvilinear search algorithm for solving three-person game. In: Proceedings of DOOR 2016. CEUR-WS, vol. 1623, pp. 574–583. http://ceur-ws.org/Vol-1623/paperme4.pdf (2016). Accessed 20 Nov 2016

  20. Howson, J.T.: Equilibria of polymatrix games. Manag. Sci. 18, 312–318 (1972)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  22. Orlov, Andrei V., Strekalovsky, Alexander S., Batbileg, S.: On computational search for Nash equilibrium in hexamatrix games. Optim. Lett. 10(2), 369–381 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  23. Mills, H.: Equilibrium points in finite games. J. Soc. Ind. Appl. Math. 8(2), 397–402 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  24. Gornov, A., Zarodnyuk, T.: Computing technology for estimation of convexity degree of the multiextremal function. Mach. Learn. Data Anal. 10(1), 1345–1353 (2014)

    Google Scholar 

  25. GAMUT is a Suite of Game Generators. http://gamut.stanford.edu. Accessed 21 May 2017

  26. https://www.dropbox.com/sh/sd84lbisy5vtifn/AAB2PNVWONtK56egStv8c-Vea?dl=0. Accessed 26 June 2017

Download references

Acknowledgements

This work was partially supported by the research Grants P2016-1228 of National University of Mongolia and by the research Grant 15-07-03827 of Russian Foundation for Basic Research. We would like to thank anonymous referees for their valuable comments and suggestions which much improved the earlier version of the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. Batbileg.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Batbileg, S., Tungalag, N., Anikin, A. et al. A global optimization algorithm for solving a four-person game. Optim Lett 13, 587–596 (2019). https://doi.org/10.1007/s11590-017-1181-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-017-1181-2

Keywords

Navigation