Strictly determined game explained

In game theory, a strictly determined game is a two-player zero-sum game that has at least one Nash equilibrium with both players using pure strategies. The value of a strictly determined game is equal to the value of the equilibrium outcome.[1] [2] [3] [4] [5] Most finite combinatorial games, like tic-tac-toe, chess, draughts, and go, are strictly determined games.

Notes

The study and classification of strictly determined games is distinct from the study of Determinacy, which is a subfield of set theory.

See also

Notes and References

  1. Web site: Chapter G Summary Finite. Waner. Stefan. 1995–1996. 24 April 2009.
  2. Book: Game Theory and Politics. Steven J. Brams. 5 - 6. Two person zero-sum games with saddlepoints. Courier Dover Publications. 2004. 9780486434971.
  3. Book: A gentle introduction to game theory. Saul Stahl. 54. Solutions of zero-sum games. AMS Bookstore. 1999. 9780821813393. https://archive.org/details/gentleintroducti0000stah/page/54.
  4. Book: An Introduction to Linear Programming and the Theory of Games. Abraham M. Glicksman. 94. Elementary aspects of the theory of games. Courier Dover Publications. 2001. 9780486417103.
  5. Book: Fun mathematics on your microcomputer. Czes Kośniowski. 68. Playing the Game. Cambridge University Press. 1983. 9780521274517.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Strictly determined game".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.