Exact algorithms for solving stochastic games: extended abstract

Authors:
Kristoffer Arnsfelt Hansen;Michal Koucky;Niels Lauritzen;Peter Bro Miltersen;Elias P. Tsigaridas
Affiliations:
University of Aarhus, Aarhus, Denmark;Institute of Mathematics of the Czech Academy of Sciences, Prague, Czech Rep;University of Aarhus, Aarhus, Denmark;Aarhus University, Aarhus, Denmark;Aarhus University, Aarhus, Denmark
Venue:
Proceedings of the forty-third annual ACM symposium on Theory of computing
Year:
2011

Citing 13
Cited 5

Mathematics for computer algebra

Mathematics for computer algebra
The complexity of stochastic games

Information and Computation
Fundamental problems of algorithmic algebra

Fundamental problems of algorithmic algebra
Introduction to Linear Optimization

Introduction to Linear Optimization
Strategy Improvement for Concurrent Reachability Games

QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Concurrent reachability games

Theoretical Computer Science
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience

LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
The Complexity of Solving Stochastic Games on Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
The DMM bound: multivariate (aggregate) separation bounds

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Bounding the radii of balls meeting every connected component of semi-algebraic sets

Journal of Symbolic Computation
The complexity of solving reachability games using value and strategy iteration

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Recursive concurrent stochastic games

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II

The complexity of solving reachability games using value and strategy iteration

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Repeated zero-sum games with budget

Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Critical point methods and effective real algebraic geometry: new results and trends

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Upper bounds for newton's method on monotone polynomial systems, and p-time model checking of probabilistic one-counter automata

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Patience of matrix games

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.