Jump to content

Kuhn's theorem

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Econjobrumors (talk | contribs) at 20:10, 20 June 2019 (I removed an external link to an incorrect source. The source stated Zermelo's theorem and incorrectly called it Kuhn's theorem.). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In game theory, Kuhn's theorem relates perfect recall, mixed and unmixed strategies and their expected payoffs. It is named after Harold W. Kuhn.

The theorem states that in a game where players may remember all of their previous moves/states of the game available to them, for every mixed strategy there is a behavioral strategy that has an equivalent payoff (i.e. the strategies are equivalent). The theorem does not specify what this strategy is, only that it exists. It is valid both for finite games, as well as infinite games (i.e. games with continuous choices, or iterated infinitely).[1]

References

[edit]
  1. ^ Aumann, Robert (1964), "Mixed and behavior strategies in infinite extensive games", in Dresher, M.; Shapley, L. S.; Tucker, A. W. (eds.), Advances in Game Theory, Annals of Mathematics Studies, vol. 52, Princeton, NJ, USA: Princeton University Press, pp. 627–650, ISBN 9780691079028.