It is shown that a saddle-point solution exists in a two-person, zero-sum game whose payoff is given by a matrix which is not completely defined. On the other hand, we show that such games do not always have a value, so that a saddle-point solution is not necessarily an optimal solution.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Blaquiere, A.,Quantitative Games: Problem Statement and Examples, New Geometric Aspects, Advanced Study Institute on the Theory and Application of Differential Games, Control Theory Centre, University of Warwick, Coventry, England, 1974.
Blaquiere, A.,An Example of Multistage Stochastic Game, Paper Presented at the Symposium on Optimization Problems in Engineering and Economics, Naples, Italy, 1974.
Berge, C.,Espaces Topologiques, Fonctions Multivoques, Dunod, Paris, France, 1966.
This work was supported by the Centre d'Etudes Atomiques, Saclay, France.
Communicated by G. Leitmann
About this article
Cite this article
Sprzeuzkouski, A. Zero-sum games with incompletely defined payoff. J Optim Theory Appl 18, 103–118 (1976). https://doi.org/10.1007/BF00933798
- Zero-sum games
- mixed strategies
- saddle-point solutions
- optimal strategies