Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems

Authors:
Nir Halman
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA 02139, USA
Venue:
Algorithmica
Year:
2007

Citing 0
Cited 14

Solving Simple Stochastic Games

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The Complexity of Solving Stochastic Games on Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths

ACM Transactions on Algorithms (TALG)
Simple stochastic games with few random vertices are easy to solve

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
On strategy improvement algorithms for simple stochastic games

Journal of Discrete Algorithms
Automatizability and simple stochastic games

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A subexponential lower bound for the random facet algorithm for parity games

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On strategy improvement algorithms for simple stochastic games

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
A pumping algorithm for ergodic stochastic mean payoff games with perfect information

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Polynomial-Time algorithms for energy games with special weight structures

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor

Journal of the ACM (JACM)
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A note on the approximation of mean-payoff games

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a Simple Stochastic Game (SSG) can be formulated as an LP-type problem. Using this formulation, and the known algorithm of Sharir and Welzl [SW] for LP-type problems, we obtain the first strongly subexponential solution for SSGs (a strongly subexponential algorithm has only been known for binary SSGs [L]). Using known reductions between various games, we achieve the first strongly subexponential solutions for Discounted and Mean Payoff Games. We also give alternative simple proofs for the best known upper bounds for Parity Games and binary SSGs. To the best of our knowledge, the LP-type framework has been used so far only in order to yield linear or close to linear time algorithms for various problems in computational geometry and location theory. Our approach demonstrates the applicability of the LP-type framework in other fields, and for achieving subexponential algorithms.