Exact Algorithms for Solving Stochastic Games
Computer Science and Game Theory
2012-02-20 v1
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.
Keywords
Cite
@article{arxiv.1202.3898,
title = {Exact Algorithms for Solving Stochastic Games},
author = {Kristoffer Arnsfelt Hansen and Michal Koucky and Niels Lauritzen and Peter Bro Miltersen and Elias Tsigaridas},
journal= {arXiv preprint arXiv:1202.3898},
year = {2012}
}