Qualitative Determinacy and Decidability of Stochastic Games with Signals

Abstract : We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning strategies, under reachability, safety, Büchi or co-Büchi winning objectives. We prove two \emph{qualitative determinacy} results. First, in a reachability game either player 1 can achieve almost-surely the reachability objective, or player 2 can ensure surely the complementary safety objective, or both players have positively winning strategies. Second, in a Büchi game if player 1 cannot achieve almost-surely the Büchi objective, then player 2 can ensure positively the complementary co-Büchi objective. We prove that players only need strategies with finite-memory, whose sizes range from no memory at all to doubly-exponential number of states, with matching lower bounds. Together with the qualitative determinacy results, we also provide fix-point algorithms for deciding which player has an almost-surely winning or a positively winning strategy and for computing the finite memory strategy. Complexity ranges from EXPTIME to 2-EXPTIME with matching lower bounds, and better complexity can be achieved for some special cases where one of the players is better informed than her opponent.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

Contributor : Hugo Gimbert <>
Submitted on : Tuesday, January 27, 2009 - 5:52:14 PM
Last modification on : Friday, November 16, 2018 - 1:24:51 AM
Long-term archiving on: Tuesday, June 8, 2010 - 9:30:33 PM


Files produced by the author(s)


  • HAL Id : hal-00356566, version 1


Nathalie Bertrand, Blaise Genest, Hugo Gimbert. Qualitative Determinacy and Decidability of Stochastic Games with Signals. LICS'09, IEEE Symposium on logic in computer science, Aug 2009, Los Angeles, United States. pp.0. ⟨hal-00356566⟩



Record views


Files downloads