Perfect information stochastic priority games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 850-861

  Gimbert, Hugo ^a   Zielonka, Wieslaw ^b  

^a ECOLE POLYTECHNIQUE   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; INFORMATION THEORY; RANDOM PROCESSES;

CLASSICAL DISCOUNT PAYOFF; STOCHASTIC PRIORITY GAMES;

GAME THEORY;

EID: 38149118048     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_73     Document Type: Conference Paper

References (15)

1. Shapley, L.S.: Stochastic games. Proceedings Nat. Acad, of Science USA 39, 1095-1100 (1953)
2. Emerson, E., Jutla, C.: Tree automata, μ-calculus and determinacy. In: FOCS 1991, pp. 368-377. IEEE Computer Society Press, Los Alamitos (1991)
3. de Alfaro, L., Henzinger, T.A., Majumdar, R.: Discounting the future in systems theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1022-1037. Springer, Heidelberg (2003)
4. de Alfaro, L., Majumdar, R.: Quantitative solution to omega-regular games. Journal of Computer and System Sciences 68, 374-397 (2004)
5. Gimbert, H., Zielonka, W.: Deterministic priority mean-payoff games as limits of discounted games. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052(Part II), pp. 312-323. Springer, Heidelberg (2006)
6. Chatterejee, K., Jurdziòski, M., Henzinger, T.: Quantitative stochastic parity games. In: Proceedings of the 15th Annual Symposium on Discrete Algorithms SODA, pp. 114-123 (2004)
7. McIver, A., Morgan, C.: Games, probability and the quantitative μ-calculus qmu. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol. 2514, pp. 292-310. Springer, Heidelberg (2002), Full version arxiv.org/abs/cs.L0/0309024
8. de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (December 1997)
9. Zielonka, W.: Perfect-information stochastic parity games. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 499-513. Springer, Heidelberg (2004)
10. Osborne,M.J.,Rubinstein,A.:ACourseinGameTheory.MITPress,Cambridge(2002)
11. Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)
12. McIver, A., Morgan, C.: A novel stochastic game via the quantitative mu-calculus. In: Cerone, A., Wiklicky, H. (eds.) QAPL 2005. Proc. of the Third Workshop on Quantitative Aspects of Programming Languages. ENTCS, vol. 153(2), pp. 195-212. Elsevier, Amsterdam (2005)
13. Blackwell, D.: Discrete dynamic programming. Annals of Mathematical Statistics 33, 719-726 (1962)
14. Hordijk, A., Yushkevich, A.: Blackwell optimality. In: Feinberg, E., Schwartz, A. (eds.) Handbook of Markov Decision Processes, Kluwer, Dordrecht (2002)
15. Titchmarsh, E.: The Theory of Functions, 2nd edn. Oxford University Press, Oxford