64 search results - page 3 / 13 » Solving Parity Games in Practice |
SIAMCOMP
2008
13 years 5 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
FSTTCS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper proposes a new algorithm that improves the complexity bound for solving parity games. Our approach combines McNaughton’s iterated fixed point algorithm with...
CSL
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents a novel strategy improvement algorithm for parity and payoff games, which is guaranteed to select, in each improvement step, an optimal combination of local str...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
FSTTCS
2008
Springer
13 years 6 months ago
2008
Springer
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect informatio...