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 results in an infinite path and the conflicting goals of the two players are -regular path properties, formalized as parity winning conditions. The qualitative solution of such a game amounts to computing the set of vertices from which a player has a strategy to win with probability 1 (or with positive probability). The quantitative solution amounts to computing the value of the game in every vertex, i.e., the highest probability with which a player can guarantee satisfaction of his own objective in a play that starts from the vertex. For the important special case of one-player stochastic parity games (parity Markov decision processes) we give polynomial-time algorithms both for the qualitative and the quantitative solution. The running time of the qualitative solution is O(d

• Type: Conference
• Year: 2004
• Where: SODA
• Authors: Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger
• Keywords: Algorithms, Perfect-information Stochastic Parity, Quantitative Solution, SODA 2004, Stochastic Parity Game