DMCA
A subexponential lower bound for the Random Facet algorithm for Parity Games
Cached
Download Links
| Citations: | 6 - 5 self |
BibTeX
@MISC{Friedmann_asubexponential,
author = {Oliver Friedmann and Thomas Dueholm Hansen and Uri Zwick},
title = {A subexponential lower bound for the Random Facet algorithm for Parity Games},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Parity Games form an intriguing family of infinite duration games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of Deterministic Mean Payoff Games, which in turn is a very natural subclass of turn-based Stochastic Mean Payoff Games. It is a major open problem whether these game families can be solved in polynomial time. The currently fastest algorithms for the solution of all these games are adaptations of the randomized generalizationof linear programming. We refer to the algorithm ofMatouˇsek, Sharir and Welzl as the Random Facet algorithm. The expected running time of these algorithmsis subexponential in the size of the game, i.e., 2
Keyphrases
random facet algorithm parity game natural subclass infinite duration game automatic verification automaton theory intriguing family algorithm ofmatou sek polynomial time expected running time important problem algorithmsis subexponential major open problem randomized generalizationof linear programming game family turn-based stochastic mean payoff game deterministic mean payoff game
