Geodesic
Numerical solution of special matrix games
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 54 (2014) no. 10, pp. 1557-1562 
V. V. Morozov; K. D. Shalbuzov. Numerical solution of special matrix games. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 54 (2014) no. 10, pp. 1557-1562. http://geodesic.mathdoc.fr/item/ZVMMF_2014_54_10_a1/
@article{ZVMMF_2014_54_10_a1,
     author = {V. V. Morozov and K. D. Shalbuzov},
     title = {Numerical solution of special matrix games},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1557--1562},
     year = {2014},
     volume = {54},
     number = {10},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2014_54_10_a1/}
}
TY  - JOUR
AU  - V. V. Morozov
AU  - K. D. Shalbuzov
TI  - Numerical solution of special matrix games
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2014
SP  - 1557
EP  - 1562
VL  - 54
IS  - 10
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2014_54_10_a1/
LA  - ru
ID  - ZVMMF_2014_54_10_a1
ER  - 
%0 Journal Article
%A V. V. Morozov
%A K. D. Shalbuzov
%T Numerical solution of special matrix games
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2014
%P 1557-1562
%V 54
%N 10
%U http://geodesic.mathdoc.fr/item/ZVMMF_2014_54_10_a1/
%G ru
%F ZVMMF_2014_54_10_a1

Voir la notice de l'article provenant de la source Math-Net.Ru

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.

[1] Motskin T. S., Raifa Kh., Tompson Dzh. L., Troll R. M., “Metod dvoinogo opisaniya”, Matrichnye igry, Sb. statei, Fizmatgiz, M., 1961, 81–109

[2] Karlin S., Matematicheskie metody v teorii igr, programmirovanii i ekonomike, Mir, M., 1964

[3] Vasin A. A., Krasnoschekov P. S., Morozov V. V., Issledovanie operatsii, Izdat. tsentr “Akademiya”, M., 2008

[4] Vasilev F. P., Ivanitskii A. Yu., Lineinoe programmirovanie, Faktorial, M., 2008

[5] Morozov V. V., Shalbuzov K. D., “O reshenii diskretnoi igry raspredeleniya resursov”, Vestnik Mosk. un-ta. Ser. 15. Vychisl. matem. i kibern., 2014, no. 2, 10–16

[6] Emets O. A., Ustyan N. Yu., “Igry s kombinatornymi ogranicheniyami”, Kibernetika i sistemnyi analiz, 2008, no. 4, 134–141

[7] Emets O. O., Olkhovska O. V., “Rozv'yazuvaniya kombinatornikh zadach igrovogo tipu z obmezhennyami-perestavlennyami u obokh gravtsiv: iteratsiinii metod”, Sistemni doslidzheniya ta informatsiini tekhnologii, no. 4, 80–93

[8] Robinson Dzh., “Iterativnyi metod resheniya igr”, Matrichnye igry, Sb. statei, Fizmatgiz, M., 1961, 110–118

[9] Amvrosenko V. V., “Uskorenie skhodimosti metoda Brauna resheniya matrichnykh igr”, Ekonomika i matematicheskie metody, 1:4 (1965), 571–575

[10] Borisova E. P., Magarik I. V., “O dvukh modifikatsiyakh metoda Brauna resheniya matrichnykh igr”, Ekonomika i matematicheskie metody, 2:5 (1966), 733–738

[11] Dresher M., Strategicheskie igry. Teoriya i prilozheniya, Sovetskoe radio, M., 1964