Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

FOSSACS
2004
Springer

favoriteEmaildiscussreport

117views Software Engineering» more FOSSACS 2004»

Perfect-Information Stochastic Parity Games

13 years 10 months ago

Perfect-Information Stochastic Parity Games

Download www.liafa.jussieu.fr

We show that in perfect-information stochastic parity games with a ﬁnite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this fact by K. Chatterejee, M. Jurdzi´nski, T.A. Henzinger [2] and A.K. McIver, C.C. Morgan [14] the proof given in this paper proceeds by a straightforward induction on the number of outgoing transitions available to one of the players and is self-contained.

Wieslaw Zielonka

Real-time Traffic

Applied Computing | FOSSACS 2004 | Perfect-information Stochastic Parity | Pure Positional Strategies | ﬁnite State Space |

claim paper

Related Content

» Perfect Information Stochastic Priority Games

» A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information

» Optimal Strategies in PerfectInformation Stochastic Games with Tail Winning Conditions

» Reduction of stochastic parity to stochastic meanpayoff games

» Solving Parity Games in Practice

» Simple Stochastic Parity Games

» On the Power of Imperfect Information

» Quantitative stochastic parity games

» Recursive Markov Decision Processes and Recursive Stochastic Games

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	FOSSACS
Authors	Wieslaw Zielonka

Comments (0)