Sciweavers

SODA
2004
ACM
94views Algorithms» more  SODA 2004»
14 years 24 days ago
Quantitative stochastic parity games
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...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
FOSSACS
2004
Springer
14 years 4 months ago
Perfect-Information Stochastic Parity Games
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...
Wieslaw Zielonka