Name
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 is constant, our algorithms run in polynomial time. |
Year | Venue | Field |
|---|---|---|
2012 | STOC 11: PROCEEDINGS OF THE 43RD ACM SYMPOSIUM ON THEORY OF COMPUTING | Combinatorial game theory,Mathematical optimization,Mathematical economics,Algorithm,Game theory,Sequential game,Bondareva–Shapley theorem,Time complexity,Recursion,Mathematics,Randomized algorithms as zero-sum games |
DocType | Volume | ISSN |
Journal | abs/1202.3898 | 0737-8017 |
Citations | PageRank | References |
7 | 0.64 | 11 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kristoffer Arnsfelt Hansen | 1 | 176 | 21.40 |
| Michal Koucký | 2 | 392 | 31.87 |
| Niels Lauritzen | 3 | 19 | 1.32 |
| Peter Bro Miltersen | 4 | 1146 | 94.49 |
| Elias P. Tsigaridas | 5 | 330 | 31.01 |