Skip to main content
SpringerLink
Log in

Numerical solution of special matrix games

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

A method is proposed for solving large-sized matrix games (zero-sum games) of special form for which there is a fast algorithm of searching for the best pure strategy of a player given any mixed strategy of the opponent. Examples of problems leading to such games are given. The method proposed is numerically compared with the Brown-Robinson iterative method.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall, “The double description method,” Contrib. Theory of Games, 2, 51–73 (1953).

    MathSciNet  Google Scholar 

  2. S. Karlin, Mathematical Methods and Theory in Games, Programming, and Economics (Mir, Moscow, 1964; Dover, New York, 1992).

    MATH  Google Scholar 

  3. A. A. Vasin, P. S. Krasnoshchekov, and V. V. Morozov, Operations Research (Akademiya, Moscow, 2008) [in Russian].

    Google Scholar 

  4. F. P. Vasil’ev and A. Yu. Ivanitskii, Linear Programming (Faktorial, Moscow, 2008) [in Russian].

    MATH  Google Scholar 

  5. V. V. Morozov and K. D. Shalbuzov, “On a solution of the discrete resource allocation game,” Moscow Univ. Comput. Math. Cybern. 38(2), 37–44 (2014).

    Article  Google Scholar 

  6. O. A. Yemets and N. Yu. Ust’yan, “Games with combinatorial constraints,” Cybern. Syst. Anal. 44(4), 575–581 (2008).

    Article  MATH  Google Scholar 

  7. O. O. Yemets and O. V. Ol’khovs’ka, “Solution of combinatorial game problems with permutation constraints in both players: Iterative method,” Sist. Doslidzh. Inf. Tekhnol., No. 4, 80–93 (2012).

    Google Scholar 

  8. J. Robinson, “An iterative method of solving a game,” Ann. Math. 54(2), 296–301 (1951).

    Article  MATH  Google Scholar 

  9. V. V. Amvrosenko, “Convergence acceleration of Brown’s method for solving matrix games,” Ekon. Mat. Metody 1(4), 571–575 (1965).

    Google Scholar 

  10. E. P. Borisova and I. V. Magarik, “Two modifications of Brown’s method for solving matrix games,” Ekon. Mat. Metody 2(5), 733–738 (1966).

    MathSciNet  Google Scholar 

  11. M. Dresher, Games of Strategy: Theory and Applications (Prentice Hall, Englewood Cliffs, N.J., 1961; Sovetskoe Radio, Moscow, 1964).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119992, Russia

    V. V. Morozov & K. D. Shalbuzov

Authors
  1. V. V. Morozov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. D. Shalbuzov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. V. Morozov.

Additional information

Original Russian Text © V.V. Morozov, K.D. Shalbuzov, 2014, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2014, Vol. 54, No. 10, pp. 1557–1562.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Morozov, V.V., Shalbuzov, K.D. Numerical solution of special matrix games. Comput. Math. and Math. Phys. 54, 1499–1504 (2014). https://doi.org/10.1134/S0965542514100108

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542514100108

Keywords

Search

Navigation