Computation of the maximum guaranteed payoff in dynamic models of conflict situations
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 30 (1990) no. 2, pp. 193-199
Voir la notice de l'article provenant de la source Math-Net.Ru
The conflict situations in question are described by repeated two-person bimatrix games. The problem is to determine the maximum guaranteed payoff to the first player. A numerical algorithm computing the solution is constructed and implemented as a program.
@article{ZVMMF_1990_30_2_a2,
author = {S. A. Evseeva},
title = {Computation of the maximum guaranteed payoff in dynamic models of conflict situations},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {193--199},
publisher = {mathdoc},
volume = {30},
number = {2},
year = {1990},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_2_a2/}
}
TY - JOUR AU - S. A. Evseeva TI - Computation of the maximum guaranteed payoff in dynamic models of conflict situations JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1990 SP - 193 EP - 199 VL - 30 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_2_a2/ LA - ru ID - ZVMMF_1990_30_2_a2 ER -
%0 Journal Article %A S. A. Evseeva %T Computation of the maximum guaranteed payoff in dynamic models of conflict situations %J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki %D 1990 %P 193-199 %V 30 %N 2 %I mathdoc %U http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_2_a2/ %G ru %F ZVMMF_1990_30_2_a2
S. A. Evseeva. Computation of the maximum guaranteed payoff in dynamic models of conflict situations. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 30 (1990) no. 2, pp. 193-199. http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_2_a2/