Combinatorial structure and randomized subexponential algorithms for infinite games

Authors:
Henrik Björklund;Sergei Vorobyov
Affiliations:
Information Technology Department, Uppsala University, Uppsala, Sweden;Information Technology Department, Uppsala University, Uppsala, Sweden
Venue:
Theoretical Computer Science
Year:
2005

Citing 22
Cited 14

Low order polynomial bounds on the expected performance of local improvement algorithms

Mathematical Programming: Series A and B
Completely unimodal numberings of a simple polytope

Discrete Applied Mathematics
From linear separability to unimodality: a hierarchy of pseudo-Boolean functions

SIAM Journal on Discrete Mathematics
Cyclic games and an algorithm to find minimax cycle means in directed graphs

USSR Computational Mathematics and Mathematical Physics
Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A subexponential randomized simplex algorithm (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A subexponential bound for linear programming

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
The complexity of stochastic games

Information and Computation
A subexponential randomized algorithm for the simple stochastic game problem

Information and Computation
The complexity of mean payoff games on graphs

Theoretical Computer Science
Theory of hybrid systems and discrete event systems

Theory of hybrid systems and discrete event systems
Competitive Markov decision processes

Competitive Markov decision processes
Linear programming, the simplex algorithm and simple polytopes

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Mean Cost Cyclical Game

Mathematics of Operations Research
Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Finite State Markovian Decision Processes

Finite State Markovian Decision Processes
A Discrete Subexponential Algorithm for Parity Games

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A Combinatorial Bound for Linear Programming and Related Problems

STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
A Discrete Strategy Improvement Algorithm for Solving Parity Games

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Memoryless determinacy of parity and mean payoff games: a simple proof

Theoretical Computer Science

A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games

Discrete Applied Mathematics
Violator spaces: structure and algorithms

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Cyclic games and linear programming

Discrete Applied Mathematics
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths

ACM Transactions on Algorithms (TALG)
Linear complementarity and p-matrices for stochastic games

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Mean-payoff games and propositional proofs

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Mean-payoff games and propositional proofs

Information and Computation
Automatizability and simple stochastic games

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Linear programming polytope and algorithm for mean payoff games

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A subexponential lower bound for the random facet algorithm for parity games

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
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

Quantified Score

Hi-index	5.23

Visualization

Abstract

The complexity of solving infinite games, including parity, mean payoff, and simple stochastic, is an important open problem in verification, automata, and complexity theory. In this paper, we develop an abstract setting for studying and solving such games, based on function optimization over certain discrete structures. We introduce new classes of recursively local-global (RLG) and partial recursively local-global (PRLG) functions, and show that strategy evaluation functions for simple stochastic, mean payoff, and parity games belong to these classes.In this setting, we suggest randomized subexponential algorithms appropriate for RLG-and PRLG-function optimization. We show that the subexponential algorithms for combinatorial linear programming, due to Kalai and Matoušek, Sharir, Welzl, can be adapted for optimizing the RLG-and PRLG-functions.