Soyster, A. L. - In: Management Science 21 (1975) 7, pp. 806-812
The ordinary finite, two-person, zero-sum game is completely defined by specifying an m \times n game matrix A. The optimal strategies for both players, and the value of the game, can be obtained by solving a dual pair of linear programming problems. In this paper a semi-infinite game is defined;...