= Stochastic game
A <stochastic game> combines a <state space> with strategic choices and probabilistic state transitions. At each stage, the current state and players' actions determine immediate <payoffs> and a <probability distribution> for the next state. A discounted, average-reward or finite-horizon rule specifies how stage rewards are aggregated.
With a single decision maker this reduces to a <Markov decision process>. With several players, a policy that is best against one fixed opponent may cease to be best when that opponent changes policy. A two-player <zero-sum game> discounted model leads to a statewise minimax <Bellman equation>, connecting strategic reasoning with <dynamic programming>.
Back to article page