Implementation of the Brown–Robinson method for solving zero-sum matrix games
Vol 41 No 3 (2025), articles
Vol 41 No 3 (2025)

Implementation of the Brown–Robinson method for solving zero-sum matrix games

articles
https://doi.org/10.36120/2587-3636.v41i3.7-16
Published November 4, 2025
Liubomir CHIRIAC
“ION CREANGĂ” State Pedagogical University of Chișinău
Natalia JOSU
“ION CREANGĂ” State Pedagogical University of Chișinău
full text

Keywords

game theory; matrix game; zero-sum game; Brown–Robinson method; iterative method; optimal strategy; upper value of the game; lower value of the game.

How to Cite

[1]
L. CHIRIAC and N. JOSU, “Implementation of the Brown–Robinson method for solving zero-sum matrix games”, ActaEd, vol. 41, no. 3, pp. 7-16, Nov. 2025.
ACM ACS APA ABNT Chicago Harvard IEEE MLA Turabian Vancouver

Download Citation

Endnote/Zotero/Mendeley (RIS) BibTeX

Abstract

This article examines the implementation of the Brown–Robinson method for solving zero-sum matrix games. It presents the theoretical foundations of the method and describes the iterative algorithm employed in this context. A practical example illustrates the step-by-step application of the method and highlights the significance of the results obtained. The study emphasizes the method’s effectiveness in identifying optimal strategies and its relevance within game theory.

https://doi.org/10.36120/2587-3636.v41i3.7-16
full text
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.