Abstract
Inspired by the paper of de Alfaro, Henzinger and Majumdar [1] about discounted μ-calculus we show new surprising links between parity games and different classes of discounted games.
This research was supported by European Research Training Network: Games and Automata for Synthesis and Validation and ACI Sécurité informatique 2003-22 VERSYDIS.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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)
Mertens, J.F., Neyman, A.: Stochastic games. International Journal of Game Theory 10, 53–56 (1981)
Emerson, E.A., Jutla, C.: Tree automata, μ-calculus and determinacy. In: FOCS 1991, pp. 368–377. IEEE Computer Society Press, Los Alamitos (1991)
Shapley, L.S.: Stochastic games. Proceedings Nat. Acad. of Science USA 39, 1095–1100 (1953)
Gimbert, H., Zielonka, W.: Games where you can play optimally without any memory. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 428–442. Springer, Heidelberg (2005)
Hordijk, A., Yushkevich, A.: Blackwell optimality. In: Feinberg, E., Schwartz, A. (eds.) Handbook of Markov Decision Processes, Kluwer, Dordrecht (2002)
Blackwell, D.: Discrete dynamic programming. Annals of Mathematical Statistics 33, 719–726 (1962)
Raghavan, T.E.S., Syed, Z.: A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information. Math. Program. 95(3), 513–532 (2003)
Vöge, J., Jurdziński, M.: A discrete strategy improvement algorithm for solving parity games. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 202–215. Springer, Heidelberg (2000)
Jurdziński, M.: Deciding the winner in parity games is in UP ∩ co-UP. Information Processing Letters 68(3), 119–124 (1998)
Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Computer Science 158(1-2), 343–359 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gimbert, H., Zielonka, W. (2006). Deterministic Priority Mean-Payoff Games as Limits of Discounted Games. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787006_27
Download citation
DOI: https://doi.org/10.1007/11787006_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35907-4
Online ISBN: 978-3-540-35908-1
eBook Packages: Computer ScienceComputer Science (R0)