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 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.

• Type: Conference
• Year: 2004
• Where: FOSSACS
• Authors: Wieslaw Zielonka
• Keywords: Applied Computing, FOSSACS 2004, Perfect-information Stochastic Parity, Pure Positional Strategies, finite State Space