Solving simple stochastic tail games

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 847-862

  Gimbert, Hugo ^a   Horn, Florian ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GAMES; STOCHASTIC MODELS;

ALGORITHM COMPUTING; ALGORITHMIC PROBLEMS; BOOLEAN COMBINATIONS; HOSTILE ENVIRONMENTS; OPTIMAL STRATEGIES; PERFECT INFORMATIONS; QUALITATIVE ANALYSIS; WINNING CONDITIONS;

STOCHASTIC SYSTEMS;

EID: 77951692953     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.69     Document Type: Conference Paper

References (35)

1. [BBG08] Christel Baier, Nathalie Bertrand, and Marcus Groesser. On Decision Problems for Probabilistic Büchi Automata. In Proceedings of the 11th International Conference on the Foundations of Software Science and Computational Structures, FoSSaCS'08, volume 4972 of Lecture Notes in Computer Science, pages 287-301. Springer-Verlag, 2008.
2. [BGG09] Nathalie Bertrand, Blaise Genest, and Hugo Gimbert. Qualitative Determinacy and Decidability of Stochastic Games with Signals. In Proceedings of the 24rd Annual IEEE Symposium on Logic in Computer Science, LICS'09, pages 319-328. IEEE Computer Society, 2009.
3. [BL69] J. Richard Büchi and Lawrence H. Landweber. Solving Sequential Conditions by Finite-State Strategies. Transactions of the American Mathematical Society, 138:295-311, 1969.
4. [CdAH05] Krishnendu Chatterjee, Luca de Alfaro, and Thomas A. Henzinger. The Complexity of Stochastic Rabin and Streett Games. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, ICALP'05, volume 3580 of Lecture Notes in Computer Science, pages 878-890. Springer-Verlag, 2005.
5. [CDHR07] Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin. Algorithms for Omega-regular Games of Incomplete Information. Logical Methods in Computer Science, 3(3), 2007.
6. [CH06] Krishnendu Chatterjee and Thomas A. Henzinger. Strategy Improvement for Stochastic Rabin and Streett Games. In Proceedings of the 17th International Conference on Concurrency Theory, CONCUR'06, volume 4137 of Lecture Notes in Computer Science, pages 375-389. Springer-Verlag, 2006.
7. [Cha07a] Krishnendu Chatterjee. Concurrent Games with Tail Objectives. Theoretical Computer Science, 388(1-2):181-198, 2007.
8. [Cha07b] Krishnendu Chatterjee. Optimal Strategy Synthesis in Stochastic Muller Games. In Proceedings of the 10th International Conference on the Foundations of Software Science and Computational Structures, FoSSaCS'07, volume 4423 of Lecture Notes in Computer Science, pages 138-152. Springer-Verlag, 2007.
9. [Cha07c] Krishnendu Chatterjee. Stochastic Müller Games are PSPACE-Complete. In Proceedings of the 27th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS'07, volume 4855 of Lecture Notes in Computer Science, pages 436-448. Springer-Verlag, 2007.
10. [Cha07d] Krishnendu Chatterjee. Stochastic w-regular Games. PhD thesis, University of California at Berkeley, 2007.
11. [CHH08] Krishnendu Chatterjee, Thomas A. Henzinger, and Florian Horn. Stochastic Finitary Games. Technical Report 2008-3002, Laboratoire d'Informatique Algorithmique: Fondements et Applications, CNRS UMR 7089, 2008.
12. [CHP07] Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. Generalized Parity Games. In Proceedings of the 10th International Conference on the Foundations of Software Science and Computational Structures, FoSSaCS'07, volume 4423 of Lecture Notes in Computer Science, pages 153-167. Springer-Verlag, 2007.
13. [CJH03] Krishnendu Chatterjee, Marcin Jurdziński, and Thomas A. Henzinger. Simple Stochastic Parity Games. In Proceedings of the 12th EACSL Annual Conference on Computer Science and Logic, CSL '03, volume 2803 of Lecture Notes in Computer Science, pages 100-113. Springer-Verlag, 2003.
14. [CJH04] Krishnendu Chatterjee, Marcin Jurdziński, and Thomas A. Henzinger. Quantitative Stochastic Parity Games. In Proceedings of the 15th Symposium on Discrete Algorithms, SODA '04, pages 121-130. Society for Industrial and Applied Mathematics, 2004.
15. [Con92] Anne Condon. The Complexity of Stochastic Games. Information and Computation, 96(2):203-224, 1992.
16. [CY95] Costas Courcoubetis and Mihalis Yannakakis. The Complexity of Probabilistic Verification. Journal of the ACM, 42(4):857-907, 1995.
17. [dA97] Luca de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
18. [dAH00] Luca de Alfaro and Thomas A. Henzinger. Concurrent w-regular Games. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, LICS'00, pages 141-154. IEEE Computer Society, 2000.
19. [Dur96] Richard Durett. Probability Theory and Examples. Duxbury Press, 1996.
20. [GH09] Hugo Gimbert and Florian Horn. Solving Simple Stochastic Games with Few Random Vertices. Logical Methods in Computer Science, 5(2):9th, 2009.
21. [Gim06] Hugo Gimbert. Jeux Positionels. PhD thesis, Université Paris VII - Denis Diderot, 2006.
22. [Gim07] Hugo Gimbert. Pure Stationary Optimal Strategies in Markov Decision Processes. In Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science, STACS'07, volume 4393 of Lecture Notes in Computer Science, pages 200-211. Springer-Verlag, 2007.
23. [GS09] Vincent Gripon and Olivier Serre. Qualitative Concurrent Games with Imperfect Information. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming, ICALP'09, volume 5556 of Lecture Notes in Computer Science, pages 200-211. Springer-Verlag, 2009.
24. [GTW02] Erich Grädel, Wolfgang Thomas, and Thomas Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001], volume 2500 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
25. [HK66] Alan J. Hoffman and Richard M. Karp. On Nonterminating Stochastic Games. Management Science, 12(5):359-370, 1966.
26. [Hor08a] Florian Horn. Explicit Muller Games are PTIME. In Proceedings of the 28th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS'08, volume 2 of Leibniz International Proceedings in Informatics, pages 235-243. Schloß Dagstuhl, 2008.
27. [Hor08b] Florian Horn. Random Games. PhD thesis, Université Paris 7 and RWTH Aachen, 2008.
28. [KS81] Panganamala R. Kumar and Tzong-Huei Shiau. Existence of Value and Randomized Strategies in Zero-sum Discrete-time Stochastic Dynamic Games. SIAM Journal on Control and Optimization, 19(5):617-634, 1981.
29. [Mar98] Donald A. Martin. The Determinacy of Blackwell Games. Journal of Symbolic Logic, 63(4):1565-1581, 1998.
30. [MN81] Jean-François Mertens and Abraham Neyman. Stochastic Games. International Journal of Game Theory, 10:53-56, 1981.
31. [MS98] Ashok P. Maitra and William D. Sudderth. Finitely additive stochastic games with Borel measurable payoffs. International Journal of Game Theory, 27(2):257-267, 1998. (Pubitemid 128341646)
32. [Paz71] Azaria Paz. Introduction to Probabilistic Automata. Academic Press, 1971.
33. [PR89] Amir Pnueli and Roni Rosner. On the Synthesis of a Reactive Module. In Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, POPL'89, pages 179-190, 1989.
34. [Sha53] Lloyd S. Shapley. Stochastic Games. In Proceedings of the National Academy of Science of the USA, volume 39, pages 1095-1100, 1953.
35. [Som05] Rafal Somla. New Algorithms for Solving Simple Stochastic Games. 119(1):51-65, 2005.