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 survey of linear programming in randomized subexponential time
ACM SIGACT News
A subexponential randomized algorithm for the simple stochastic game problem
Information and Computation
The complexity of mean payoff games on graphs
Theoretical Computer Science
Fast and simple nested fixpoints
Information Processing Letters
An improved algorithm for the evaluation of fixpoint expressions
Theoretical Computer Science
Mathematics of Operations Research
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th 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
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A randomized subexponential algorithm for parity games
Nordic Journal of Computing
Memoryless determinacy of parity and mean payoff games: a simple proof
Theoretical Computer Science
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Combinatorial structure and randomized subexponential algorithms for infinite games
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
Violator spaces: Structure and algorithms
Discrete Applied Mathematics
Cyclic games and linear programming
Discrete Applied Mathematics
A CSP-Based Approach for Solving Parity Game
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Algorithms for Solving Infinite Games
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence
A hybrid algorithm for LTL games
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Non-oblivious strategy improvement
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Quantitative synthesis for concurrent programs
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Strategy improvement and randomized subexponential algorithms for stochastic parity games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Solving parity games by a reduction to SAT
Journal of Computer and System Sciences
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Strategy improvement for stochastic rabin and streett games
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Alternating traps in Muller and parity games
Theoretical Computer Science
| Hi-index | 0.00 |
We suggest a new randomized algorithm for solving parity games with worst case time complexity roughly min(O(n3 驴 (n/k+ 1)k), 2O(驴n log n), where n is the number of vertices and k the number of colors of the game. This is comparable with the previously known algorithms when the number of colors is small. However, the subexponential bound is an advantage when the number of colors is large, k = 驴(n1/2+驴).