Finite Approximations to a Zero-Sum Game with Incomplete Information

摘要

This paper investigates a scheme for approximating a two-person zero-sum game G of incomplete information by means of a natural system G (mn) of its finite subgames. The main question is: For large m and n, is an optimal strategy for G (mn) necessarily an epsilon-optimal strategy for G. Keywords: Theorems, Computations. (kr)