Geodesic
Guaranteed strategies with memory for alternative pursuit
Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 4 (2012) no. 4, pp. 114-128

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

A game is called alternative if it may be terminated by the pursuer on any of two given terminal manifolds, where the payoffs of Boltza type differ only in their terminal parts. Assuming that the optimal strategies and trajectories for both corresponding games with given symmetric alternatives known, we discuss how to construct pursuit strategies that provide a guaranteed outcome in the original game. We describe a pursuit strategy with memory and a finite number of admissible updates for the targeted terminal alternative and study its guaranteed features. 
@article{MGTA_2012_4_4_a6,
     author = {Igor I. Shevchenko},
     title = {Guaranteed strategies with memory for alternative pursuit},
     journal = {Matemati\v{c}eska\^a teori\^a igr i e\"e prilo\v{z}eni\^a},
     pages = {114--128},
     publisher = {mathdoc},
     volume = {4},
     number = {4},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MGTA_2012_4_4_a6/}
}
TY  - JOUR
AU  - Igor I. Shevchenko
TI  - Guaranteed strategies with memory for alternative pursuit
JO  - Matematičeskaâ teoriâ igr i eë priloženiâ
PY  - 2012
SP  - 114
EP  - 128
VL  - 4
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MGTA_2012_4_4_a6/
LA  - ru
ID  - MGTA_2012_4_4_a6
ER  - 
%0 Journal Article
%A Igor I. Shevchenko
%T Guaranteed strategies with memory for alternative pursuit
%J Matematičeskaâ teoriâ igr i eë priloženiâ
%D 2012
%P 114-128
%V 4
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MGTA_2012_4_4_a6/
%G ru
%F MGTA_2012_4_4_a6
Igor I. Shevchenko. Guaranteed strategies with memory for alternative pursuit. Matematičeskaâ teoriâ igr i eë priloženiâ, Tome 4 (2012) no. 4, pp. 114-128. http://geodesic.mathdoc.fr/item/MGTA_2012_4_4_a6/