Minimax Theorems for Games with Imperfect Transfer of Information

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.