Skip to main content
SpringerLink
Log in

General Theorem on a Finite Support of Mixed Strategy in the Theory of Zero-Sum Games

  • Mathematics
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

Abstract

A theorem related to the theory of zero-sum games is proved. Rather general assumptions on the payoff function are found that are sufficient for an optimal strategy of one of the players to be chosen in the class of mixed strategies concentrated in at most m + 1 points if the opponent chooses a pure strategy in a finite-dimensional convex compact set and m is its dimension. This theorem generalizes results of several authors, starting from Bohnenblust, Karlin, and Shapley (1950).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. F. Bohnenblust, S. Karlin, and L. S. Shapley, Contrib. Theory Games 20 (1), 181–192 (1950).

    Google Scholar 

  2. N. N. Vorob’ev, Basics of Game Theory (Nauka, Moscow, 1984) [in Russian].

    Google Scholar 

  3. Handbook of Game Theory with Economic Applications, Ed. by R. J. Aumann and S. Hart (Elsevier Science, New York, 1994), Vol. 2. pp. 735–1520.

  4. H. Kneser, C. R. Acad. Sci. Paris Ser. I: Math. 234, 2418–2420(1952).

    Google Scholar 

  5. K. Fan, Proc. Natl. Acad. Sci. 39 (1), 42–47 (1953).

    Article  Google Scholar 

  6. M. Sion, Pacific J. Math. 8, 171–176 (1958).

    Article  MathSciNet  Google Scholar 

  7. E. G. Davydov, Methods and Models of the Theory of Antagonistic Games (Mosk. Gos. Univ., Moscow, 1978) [in Russian].

    MATH  Google Scholar 

  8. L. G. Shnirel’man, Izv. Akad. Nauk. SSSR Ser. Mat. 2 (1), 53–60 (1938).

    Google Scholar 

  9. A. B. Kurzhanskii, Control and Observation under Uncertainty (Fizmatlit, Moscow, 1977) [in Russian].

    MATH  Google Scholar 

  10. E. Helly, Jahresber. Deutsch. Math.-Verein. 32, 175–176 (1923).

    Google Scholar 

  11. A. D. Alexandroff, Mat. Sb. 13 (2–3), 169–238 (1943).

    Google Scholar 

  12. D. W. Stroock, Probability Theory: An Analytic View (Cambridge University Press, New York, 2011).

    MATH  Google Scholar 

  13. W. Fenchel, Convex Cones, Sets, and Functions (Department of Mathematics, Princeton University, Princeton, 1953).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Moscow, Russia

    S. N. Smirnov

  2. National Research University Higher School of Economics, Moscow, Russia

    S. N. Smirnov

Authors
  1. S. N. Smirnov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. N. Smirnov.

Additional information

Original Russian Text © S.N. Smirnov, 2018, published in Doklady Akademii Nauk, 2018, Vol. 480, No. 1, pp. 25–28.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Smirnov, S.N. General Theorem on a Finite Support of Mixed Strategy in the Theory of Zero-Sum Games. Dokl. Math. 97, 215–218 (2018). https://doi.org/10.1134/S1064562418030055

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064562418030055

Search

Navigation