|
|
Teoriya Veroyatnostei i ee Primeneniya, 1962, Volume 7, Issue 1, Pages 89–95
(Mi tvp4702)
|
|
|
|
Short Communications
Minimax Theorems for Games with Imperfect Transfer of Information
J. V. Romanovsky Leningrad
Abstract:
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.
Received: 21.04.1960
Citation:
J. V. Romanovsky, “Minimax Theorems for Games with Imperfect Transfer of Information”, Teor. Veroyatnost. i Primenen., 7:1 (1962), 89–95; Theory Probab. Appl., 7:1 (1962), 87–93
Linking options:
https://www.mathnet.ru/eng/tvp4702 https://www.mathnet.ru/eng/tvp/v7/i1/p89
|
| Statistics & downloads: |
| Abstract page: | 162 | | Full-text PDF : | 92 | | References: | 2 |
|