On strong determinacy of countable stochastic games

We study 2-player turn-based perfect-information stochastic games with countably infinite state space. The players aim at maximizing/minimizing the probability of a given event (i.e., measurable set of infinite plays), such as reachability, Büchi, ω-regular or more general objectives.

[1]  Parosh Aziz Abdulla,et al.  Stochastic Parity Games on Lossy Channel Systems , 2014, Log. Methods Comput. Sci..

[2]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[3]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[4]  Tomás Brázdil,et al.  Qualitative reachability in stochastic BPA games , 2011, Inf. Comput..

[5]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[6]  Krishnendu Chatterjee,et al.  Quantitative stochastic parity games , 2004, SODA '04.

[7]  Krishnendu Chatterjee,et al.  Simple Stochastic Parity Games , 2003, CSL.

[8]  Kousha Etessami,et al.  Recursive Concurrent Stochastic Games , 2008, Log. Methods Comput. Sci..

[9]  Kousha Etessami,et al.  Recursive Stochastic Games with Positive Rewards , 2008, ICALP.

[10]  Kousha Etessami,et al.  Recursive Markov Decision Processes and Recursive Stochastic Games , 2005, ICALP.

[11]  S. Br,et al.  QUALITATIVE REACHABILITY IN STOCHASTIC BPA GAMES , 2009 .

[12]  U. Rieder,et al.  Markov Decision Processes , 2010 .

[13]  V. Broek.  Determinacy and optimal strategies in infinite-state stochastic reachability games , 2013 .

[14]  Donald A. Martin,et al.  The determinacy of Blackwell games , 1998, Journal of Symbolic Logic.

[15]  Thomas A. Henzinger,et al.  Concurrent reachability games , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[16]  Antonín Kucera,et al.  Turn-based stochastic games , 2011, Lectures in Game Theory for Computer Scientists.

[17]  Kousha Etessami,et al.  One-counter Markov decision processes , 2009, SODA '10.

[18]  J. Krcál,et al.  Determinacy and Optimal Strategies in Stochastic Games , 2009 .

[19]  J. Norris.  Appendix: probability and measure , 1997 .

[20]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[21]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[22]  Dominik Wojtczak,et al.  The Complexity of Nash Equilibria in Stochastic Multiplayer Games , 2011, Log. Methods Comput. Sci..

[23]  Krishnendu Chatterjee,et al.  Strategy Improvement for Concurrent Reachability Games , 2006, Third International Conference on the Quantitative Evaluation of Systems - (QEST'06).

[24]  William D. Sudderth,et al.  Finitely additive stochastic games with Borel measurable payoffs , 1998, Int. J. Game Theory.

[25]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[26]  Thomas A. Henzinger,et al.  Concurrent omega-regular games , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[27]  Thomas A. Henzinger,et al.  Concurrent reachability games , 2007, Theor. Comput. Sci..

[28]  Florian Horn,et al.  Solving simple stochastic tail games , 2010, SODA '10.

[29]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.