Markov strategy

In game theory, a Markov strategy[1] is one that depends only on state variables that summarize the history of the game in one way or another.[2] For instance, a state variable can be the current play in a repeated game, or it can be any interpretation of a recent sequence of play.

A profile of Markov strategies is a Markov perfect equilibrium if it is a Nash equilibrium in every state of the game. The Markov strategy was invented by Andrey Markov.[3]

References

  1. ^ "First Links in the Markov Chain". American Scientist. 2017-02-06. Retrieved 2017-02-06.
  2. ^ Fudenberg, Drew (1995). Game Theory. Cambridge, MA: The MIT Press. pp. 501–40. ISBN 0-262-06141-4.
  3. ^ Sack, Harald (2022-06-14). "Andrey Markov and the Markov Chains". SciHi Blog. Retrieved 2017-11-23.
  • v
  • t
  • e
Topics in game theory
Definitions
  • Congestion game
  • Cooperative game
  • Determinacy
  • Escalation of commitment
  • Extensive-form game
  • First-player and second-player win
  • Game complexity
  • Graphical game
  • Hierarchy of beliefs
  • Information set
  • Normal-form game
  • Preference
  • Sequential game
  • Simultaneous game
  • Simultaneous action selection
  • Solved game
  • Succinct game
Equilibrium
conceptsStrategiesClasses
of gamesGamesTheoremsKey
figuresMiscellaneous


Stub icon

This game theory article is a stub. You can help Wikipedia by expanding it.

  • v
  • t
  • e