Quantitative Stochastic Parity Games

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 114-123

  Chatterjee, Krishnendu ^a   Jurdziński, Marcin ^a   Henzinger, Thomas A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARITY GAMES; PROBABILISTIC TRANSITIONS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; GRAPH THEORY; LINEAR PROGRAMMING; MARKOV PROCESSES; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING;

GAME THEORY;

EID: 1842473652     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. A. Arnold and D. Niwiński. Rudiments of μ-Calculus, volume 146 of Studies in Logic and the Foundations of Mathematics. Elsevier, 2001.
2. A. Arnold, A. Vincent, and I. Walukiewicz. Games for synthesis of controllers with partial observation. Theoretical Computer Science, 303(1):7-34, 2003.
3. J. Bradfield. The modal μ-calculus alternation hierarchy is strict. Theoretical Computer Science, 195(2):133-153, 1998.
4. K. Chatterjee, M. Jurdziński, and T. A. Henzinger. Simple stochastic parity games. In CSL'03, volume 2803 of LNCS, pages 100-113. Springer, 2003.
5. A. Condon. The complexity of stochastic games. Information and Computation, 96:203-224, 1992.
6. C. Courcoubetis and M. Yannakakis. Markov decision processes and regular events. In ICALP'90, volume 443 of LNCS, pages 336-349. Springer, 1990.
7. L. de Alfaro and T. A. Henzinger. Concurrent irregular games. In LICS'00, pages 141-154. IEEE Computer Society Press, 2000.
8. L. de Alfaro, T. A. Henzinger, and O. Kupferman. Concurrent reachability games. In FOCS'98, pages 564-575. IEEE Computer Society Press, 1998.
9. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. In STOC'01, pages 675-683. ACM Press, 2001. Full version to appear in the Journal of Computer and Systems Sciences. Elsevier.
10. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. In STOC'01, pages 675-683. ACM Press, 2001. Full version to appear in the Journal of Computer and Systems Sciences. Elsevier.
11. E. A. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In FOCS'91, pages 368-377. IEEE Computer Society Press, 1991.
12. E. A. Emerson, C. S. Jutla, and A. P. Sistla. On modelchecking for fragments of μ-calculus. In CAV'93, volume 697 of LNCS, pages 385-396. Springer, 1993.
13. H. Everett. Recursive games. In Contributions to the Theory of Games III, volume 39 of Annals of Mathematical Studies, pages 47-78. Princeton University Press, 1957.
14. J. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer, 1997.
15. E. Grädel, W. Thomas, and T. Wilke, editors. Automata, Logics, and Infinite Games. A Guide to Current Research, volume 2500 of LNCS. Springer, 2002.
16. Y. Gurevich and L. Harrington. Trees, automata, and games. In STOC'82, pages 60-65. ACM Press, 1982.
17. M. Jurdziński. Deciding the winner in parity games is in UP ∩ co-UP. Information Processing Letters, 68(3):119-124, 1998.
18. M. Jurdziński. Small progress measures for solving parity games. In STACS'00, volume 1770 of LNCS, pages 290-301. Springer, 2000.
19. M. L. Littman, T. Dean, and L. P. Kaelbling. On the complexity of solving Markov decision problems. In UAI'95, pages 394-402. Morgan Kaufmann, 1995.
20. D. A. Martin. The determinacy of Blackwell games. Journal of Symbolic Logic, 63(4):1565-1581, 1998.
21. A. Puri. Theory of Hybrid Systems and Discrete Event Systems. PhD thesis, University of California, Berkeley, 1995.
22. M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, 1994.
23. T. E. S. Raghavan and J. A. Filar. Algorithms for stochastic games - a survey. ZOR - Methods and Models of Operations Research, 35:437-472, 1991.
24. L. S. Shapley. Stochastic games. Proceedings Nat. Acad. of Science USA, 39:1095-1100, 1953.
25. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley and Los Angeles, 1951.
26. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Volume 3, Beyond Words, chapter 7, pages 389-455. Springer, 1997.
27. J. Vöge and M. Jurdziński. A discrete strategy improvement algorithm for solving parity games. In CAV'00, volume 1855 of LNCS, pages 202-215. Springer, 2000.
28. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1953.
29. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200:135-183, 1998.
30. U. Zwick and M. Paterson. The complexity of mean payoff games on graphs. Theoretical Computer Science, 158:343-359, 1996.