Qualitative determinacy and decidability of stochastic games with signals

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2009, Pages 319-328

  Bertrand, Nathalie ^a   Genest, Blaise ^a   Gimbert, Hugo ^b  

^a CAMPUS DE BEAULIEU   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIAL NUMBERS; FINITE MEMORY; FIXPOINTS; LOWER BOUNDS; REACHABILITY; SAFETY OBJECTIVES; STOCHASTIC GAME; THE STANDARD MODEL; WINNING STRATEGY; ZERO-SUM STOCHASTIC GAMES;

COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; CONTROL THEORY; STOCHASTIC SYSTEMS;

STOCHASTIC MODELS;

EID: 70350596517     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2009.31     Document Type: Conference Paper

References (24)

1. R. J. Aumann. Repeated Games with Incomplete Information. MIT Press, 1995.
2. C. Baier, N. Bertrand, and M. Größer. On decision problems for probabilistic Büchi automata. In Proc. of FOSSACS'08, vol.4972 of LNCS, pp. 287-301. Springer, 2008.
3. N. Bertrand, B. Genest, and H. Gimbert. Qualitative determinacy and decidability of stochastic games with signals. Technical Report hal-00356566, HAL archives ouvertes, January 2009. Previous version hal-00341288, November 2008.
4. D. Berwanger, K. Chatterjee, L. Doyen, T. A. Henzinger, and S. Raje. Strategy construction for parity games with imperfect information. In Proc. of CONCUR'08, vol.5201 of LNCS, pp. 325-339. Springer, 2008.
5. K. Chatterjee, L. de Alfaro, and T. A. Henzinger. The complexity of stochastic Rabin and Streett games. In Proc. of ICALP'05, vol.3580 of LNCS, pp. 878-890. Springer, 2005.
6. K. Chatterjee, L. Doyen, T. A. Henzinger, and J.-F. Raskin. Algorithms for omega-regular games of incomplete information. Logical Methods in Computer Science, 3(3), 2007.
7. K. Chatterjee, M. Jurdzinski, and T. A. Henzinger. Quantitative stochastic parity games. In Proc. of SODA'04, pp. 121-130. SIAM, 2004.
8. A. Condon. The complexity of stochastic games. Information and Computation, 96:203-224, 1992.
9. L. de Alfaro and T. A. Henzinger. Concurrent omega-regular games. In Proc. of LICS'00, pp. 141-154. IEEE, 2000.
10. L. de Alfaro, T. A. Henzinger, and O. Kupferman. Concurrent reachability games. Theoretical Computer Science, 386(3):188-217, 2007.
11. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. In Proc. of STOC'01, pp. 675-683. ACM, 2001.
12. H. Gimbert and F. Horn. Simple stochastic games with few random vertices are easy to solve. In Proc. of FOSSACS'08, vol.4972 of LNCS, pp. 5-19. Springer, 2008.
13. E. Grädel, W. Thomas, and T. Wilke. Automata, Logics and Infinite Games, vol.2500 of LNCS. Springer, 2002.
14. F. Horn. Random Games. PhD thesis, Université Denis- Diderot, 2008.
15. J.-F. Mertens and A. Neyman. Stochastic games have a value. In Proc. of the National Academy of Sciences USA, vol.79, pp. 2145-2146, 1982.
16. A. Paz. Introduction to probabilistic automata. Academic Press, 1971.
17. J. H. Reif. Universal games of incomplete information. In Proc. of STOC'79, pp. 288-308. ACM, 1979.
18. J. Renault. The value of repeated games with an informed controller. Technical report, CEREMADE, Paris, Jan. 2007.
19. J. Renault and S. Sorin. Personal Communications, 2008.
20. D. Rosenberg, E. Solan, and N. Vieille. Stochastic games with imperfect monitoring. Technical Report 1376, Northwestern University, July 2003.
21. O. Serre and V. Gripon. Qualitative concurrent games with imperfect information. Technical Report hal-00360857, HAL archives ouvertes, February 2009.
22. L. S. Shapley. Stochastic games. In Proc. of the National Academy of Sciences USA, vol.39, pp. 1095-1100, 1953.
23. S. Sorin. A first course on zero-sum repeated games. Springer, 2002.
24. J. von Neumann and O. Morgenstern. Theory of games and economic behavior. Princeton University Press, 1944.