Geodesic
Minimax Theorems for Games with Imperfect Transfer of Information
Teoriâ veroâtnostej i ee primeneniâ, Tome 7 (1962) no. 1, pp. 89-95 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Zero-sum two-person positional (i.e. extensive) games are considered. The players obtain random communication about their opponents’ moves; the distributions depend on these moves. The proofs of these minimax theorems are based on Wald’s idea ([1], Ch. 2) of replacing an infinite game by a similar finite one. 
@article{TVP_1962_7_1_a6,
     author = {J. V. Romanovsky},
     title = {Minimax {Theorems} for {Games} with {Imperfect} {Transfer} of {Information}},
     journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
     pages = {89--95},
     year = {1962},
     volume = {7},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TVP_1962_7_1_a6/}
}
TY  - JOUR
AU  - J. V. Romanovsky
TI  - Minimax Theorems for Games with Imperfect Transfer of Information
JO  - Teoriâ veroâtnostej i ee primeneniâ
PY  - 1962
SP  - 89
EP  - 95
VL  - 7
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/TVP_1962_7_1_a6/
LA  - ru
ID  - TVP_1962_7_1_a6
ER  - 
%0 Journal Article
%A J. V. Romanovsky
%T Minimax Theorems for Games with Imperfect Transfer of Information
%J Teoriâ veroâtnostej i ee primeneniâ
%D 1962
%P 89-95
%V 7
%N 1
%U http://geodesic.mathdoc.fr/item/TVP_1962_7_1_a6/
%G ru
%F TVP_1962_7_1_a6
J. V. Romanovsky. Minimax Theorems for Games with Imperfect Transfer of Information. Teoriâ veroâtnostej i ee primeneniâ, Tome 7 (1962) no. 1, pp. 89-95. http://geodesic.mathdoc.fr/item/TVP_1962_7_1_a6/