Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Zero-sum games with incompletely defined payoff

  • 46 Accesses

  • 1 Citations

Abstract

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.

References

  1. 1.

    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.

  2. 2.

    Blaquiere, A.,An Example of Multistage Stochastic Game, Paper Presented at the Symposium on Optimization Problems in Engineering and Economics, Naples, Italy, 1974.

  3. 3.

    Berge, C.,Espaces Topologiques, Fonctions Multivoques, Dunod, Paris, France, 1966.

Download references

Author information

Additional information

This work was supported by the Centre d'Etudes Atomiques, Saclay, France.

Communicated by G. Leitmann

Rights and permissions

Reprints and Permissions

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

Download citation

Key Words

  • Zero-sum games
  • mixed strategies
  • saddle-point solutions
  • optimal strategies