Exact Algorithms for Solving Stochastic Games
classification
💻 cs.GT
keywords
gamesstochasticalgorithmssolvingclassicaldescribedescribingdiscounted
read the original abstract
Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.