Abstract
We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority games a play can be stopped by the environment after a finite number of stages, however, infinite plays are also possible. In discounted priority games only infinite plays are possible and the payoff is a linear combination of the classical discount payoff and of a limit payoff evaluating the performance at infinity. Shapley games [1] and parity games [2] are special extreme cases of priority games.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shapley, L.S.: Stochastic games. Proceedings Nat. Acad. of Science USA 39, 1095–1100 (1953)
Emerson, E., Jutla, C.: Tree automata, μ-calculus and determinacy. In: FOCS 1991, pp. 368–377. IEEE Computer Society Press, Los Alamitos (1991)
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)
de Alfaro, L., Majumdar, R.: Quantitative solution to omega-regular games. Journal of Computer and System Sciences 68, 374–397 (2004)
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)
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)
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.LO/0309024
de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (December 1997)
Zielonka, W.: Perfect-information stochastic parity games. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 499–513. Springer, Heidelberg (2004)
Osborne, M.J., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (2002)
Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)
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)
Blackwell, D.: Discrete dynamic programming. Annals of Mathematical Statistics 33, 719–726 (1962)
Hordijk, A., Yushkevich, A.: Blackwell optimality. In: Feinberg, E., Schwartz, A. (eds.) Handbook of Markov Decision Processes, Kluwer, Dordrecht (2002)
Titchmarsh, E.: The Theory of Functions, 2nd edn. Oxford University Press, Oxford
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gimbert, H., Zielonka, W. (2007). Perfect Information Stochastic Priority Games. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_73
Download citation
DOI: https://doi.org/10.1007/978-3-540-73420-8_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73419-2
Online ISBN: 978-3-540-73420-8
eBook Packages: Computer ScienceComputer Science (R0)