Skip to main content
Springer Nature Link
Log in

Deterministic Priority Mean-Payoff Games as Limits of Discounted Games

  • Conference paper
Automata, Languages and Programming (ICALP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4052))

Included in the following conference series:

  • 6300 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)

    Chapter  Google Scholar 

  2. Mertens, J.F., Neyman, A.: Stochastic games. International Journal of Game Theory 10, 53–56 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  3. Emerson, E.A., Jutla, C.: Tree automata, μ-calculus and determinacy. In: FOCS 1991, pp. 368–377. IEEE Computer Society Press, Los Alamitos (1991)

    Google Scholar 

  4. Shapley, L.S.: Stochastic games. Proceedings Nat. Acad. of Science USA 39, 1095–1100 (1953)

    Article  MATH  MathSciNet  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Hordijk, A., Yushkevich, A.: Blackwell optimality. In: Feinberg, E., Schwartz, A. (eds.) Handbook of Markov Decision Processes, Kluwer, Dordrecht (2002)

    Google Scholar 

  7. Blackwell, D.: Discrete dynamic programming. Annals of Mathematical Statistics 33, 719–726 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  8. 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)

    Article  MATH  MathSciNet  Google Scholar 

  9. 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)

    Chapter  Google Scholar 

  10. Jurdziński, M.: Deciding the winner in parity games is in UP ∩ co-UP. Information Processing Letters 68(3), 119–124 (1998)

    Article  MathSciNet  Google Scholar 

  11. Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Computer Science 158(1-2), 343–359 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instytut Informatyki, Warsaw University, Poland

    Hugo Gimbert

  2. Université Paris 7 and CNRS, LIAFA, case 7014, 2, place Jussieu, 75251 Cedex 05, Paris, France

    Wiesław Zielonka

Authors
  1. Hugo Gimbert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wiesław Zielonka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università Ca’ Foscari, Venice,  

    Michele Bugliesi

  2. Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    Bart Preneel

  3. ECS, University of Southampton, UK

    Vladimiro Sassone

  4. FB Informatik, LS2, Univ. Dortmund, 44221, Dortmund, Germany

    Ingo Wegener

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics