1599 search results - page 3 / 320 » Algorithms for Parity Games |
150
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
126
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
The Lemke
120
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play resul...
122
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. This article extends the idea of solving parity games by strategy iteration to non-deterministic strategies: In a non-deterministic strategy a player restricts himself to...
134
Voted
SIAMCOMP
2008
15 years 3 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...