Hostname: page-component-77c89778f8-vpsfw Total loading time: 0 Render date: 2024-07-24T15:36:24.678Z Has data issue: false hasContentIssue false
  • English
  • Français

Certain Infinite Zero-Sum Two-Person Games

Published online by Cambridge University Press:  20 November 2018

A. L. Dulmage  and
J. E. L. Peck
A. L. Dulmage
Affiliation:
Royal Military College of Canada
J. E. L. Peck
Affiliation:
University of New Brunswick
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

1. Introduction. The theorem of von Neumann, that every finite, zero-sum two-person game has a value, has been extended in various ways to infinite games. In particular Wald (6) has shown that any bounded game in which one player has finitely many pure strategies, has a value. Our interest was aroused by the infinite analogue of the game of “hide and seek” as described by von Neumann (5), which does not appear to fit any of the known cases, unless the matrix is bounded.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 8 , 1956 , pp. 412 - 416
Copyright
Copyright © Canadian Mathematical Society 1956

References

1. Blackwell, D. and Girshick, M. A., Theory of Games and Statistical Decisions (Wiley, 1954).Google Scholar
2. Bohnenblust, H. F., Karlin, S. and Shapley, L. S., Solutions of discrete games, Ann. Math. Studies, 24 (1950), 51–72.Google Scholar
3. Bourbaki, N., Topologie générale (Paris, Hermann).Google Scholar
4. Kelley, J. L., Convergence in topology, Duke Math. J., 17 (1950), 277–283.Google Scholar
5. von Neumann, J., A certain zero-sum two-person game equivalent to the optimal assignment problem, Ann. Math. Studies, 28 (1953), 5–12.Google Scholar
6. Wald, A., Generalization of a theorem by v. Neumann concerning zero sum two person games, Ann. Math., 46 (1945), 281–286.Google Scholar