1599 search results - page 9 / 320 » Algorithms for Parity Games |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
FOSSACS
2004
Springer
15 years 3 months ago
2004
Springer
We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this f...
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
