Work

Exact algorithms for solving stochastic games

Year: 2011

Type: conference-paper

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. When the number of positions of the game isbconstant, our algorithms run in polynomial time.

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/1993636.1993665

Authors: Kristoffer Arnsfelt Hansen, Michal Koucky, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas

Institutions: Aarhus University, Czech Academy of Sciences, Czech Academy of Sciences, Institute of Mathematics

Language: English

Topic: Game Theory and Applications

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: bronze