Geodesic
An algorithm for solving a two-person game with information transfer
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 46 (2006) no. 10, pp. 1784-1789 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

An algorithm for solving a two-person game with information transfer is proposed. The algorithm is based on a special linear programming problem. An example is given. 
@article{ZVMMF_2006_46_10_a6,
     author = {A. R. Mamatov},
     title = {An algorithm for solving a~two-person game with information transfer},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1784--1789},
     year = {2006},
     volume = {46},
     number = {10},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_10_a6/}
}
TY  - JOUR
AU  - A. R. Mamatov
TI  - An algorithm for solving a two-person game with information transfer
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2006
SP  - 1784
EP  - 1789
VL  - 46
IS  - 10
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_10_a6/
LA  - ru
ID  - ZVMMF_2006_46_10_a6
ER  - 
%0 Journal Article
%A A. R. Mamatov
%T An algorithm for solving a two-person game with information transfer
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2006
%P 1784-1789
%V 46
%N 10
%U http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_10_a6/
%G ru
%F ZVMMF_2006_46_10_a6
A. R. Mamatov. An algorithm for solving a two-person game with information transfer. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 46 (2006) no. 10, pp. 1784-1789. http://geodesic.mathdoc.fr/item/ZVMMF_2006_46_10_a6/

[1] Gabasov R., Kirillova F. M., Metody optimizatsii, Izd-vo BGU, Minsk, 1981

[2] Ivanilov Yu. L., “Dvoistvennye poluigry”, Izv. AN SSSR. Ser. Tekhn. kibernetika, 1972, no. 4, 3–9 | MR | Zbl

[3] Fedorov V. V., Chislennye metody maksimina, Nauka, M., 1979 | MR

[4] Azizov I., Konechnyi algoritm resheniya lineinoi maksiminnoi zadachi so svyazannymi peremennymi i rezultaty chislennogo eksperimenta, Preprint No 18(203), In-t matem. AN BSSR, Minsk, 1984, 20 pp.

[5] Lozovanu D. D., “Maksiminnye zadachi so svyazannymi peremennymi i ikh primeneniya k issledovaniyu i resheniyu tsiklicheskikh igr”, Izv. AN Moldavskoi SSR. Matematika, 1990, no. 2, 22–29 | MR | Zbl

[6] Mamatov A. R., “Algoritm resheniya lineinoi maksiminnoi zadachi so svyazannymi peremennymi”, Zh. vychisl. matem. i matem. fiz., 45:6 (2005), 1044–1047 | MR | Zbl

[7] Mamatov A. R., “Ob odnoi igrovoi zadache so svyazannymi peremennymi”, Dokl. AN RUz., 1993, no. 7, 7–13

[8] Golshtein E. G., Teoriya dvoistvennosti v matematicheskom programmirovanii i ee prilozheniya, Nauka, M., 1971 | MR

[9] Gabasov R., Kirillova F. M., Tyatyushkin A. I., Konstruktivnye metody optimizatsii. Ch. 1. Lineinye zadachi, Universitetskoe, Minsk, 1984 | MR

[10] Lipskii V., Kombinatorika dlya programmistov, Mir, M., 1988