A technique to solve mixed strategy non-cooperative zero sum games with more than two players

Ranjan Kumar Gupta and Debdip Khan

International Journal of Operational Research, 2024, vol. 49, issue 3, 385-402

Abstract: In this paper, we have proposed a technique, capable of solving m × n mixed strategy zero sum games with more than two players. To the best of our knowledge, no such definite technique is available in the literature. This work shows how one N-persons non-cooperative zero-sum game can be represented in two-dimensional space and then can be expressed as a combination of N numbers of two persons zero sum game. Using the mixed strategies of the different players obtained from the solutions (by our developed GA) of those two persons zero sum games and taking the payoffs from the initial representation of the N-persons game, the values of the game from different player's point of view have been calculated (sum being zero). Finally, our proposed technique has been demonstrated with a few examples and sensitivity analyses have been done graphically to confirm the stability of our GA.

Keywords: game theory; N -persons mixed strategy game; two-dimensional representation; two persons zero sum game; genetic algorithm. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=137131 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:49:y:2024:i:3:p:385-402

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().