The complexity of stochastic Müller games Journal Article

Author(s): Chatterjee, Krishnendu
Article Title: The complexity of stochastic Müller games
Affiliation IST Austria
Abstract: The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph games: the qualitative problem asks for the set of states from which a player can win with probability 1 (almost-sure winning); and the quantitative problem asks for the maximal probability of winning (optimal winning) from each state. We consider ω-regular winning conditions formalized as Müller winning conditions. We present optimal memory bounds for pure (deterministic) almost-sure winning and optimal winning strategies in stochastic graph games with Müller winning conditions. We also study the complexity of stochastic Müller games and show that both the qualitative and quantitative analysis problems are PSPACE-complete. Our results are relevant in synthesis of stochastic reactive processes.
Keywords: Game theory; Stochastic games; ω-Regular objectives; Müller objectives
Journal Title: Information and Computation
Volume: 211
ISSN: 0890-5401
Publisher: Elsevier  
Date Published: 2012-02-01
Start Page: 29
End Page: 48
Sponsor: The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.
DOI: 10.1016/j.ic.2011.11.004
Open access: no
IST Austria Authors
Related IST Austria Work