Bounding Average-Energy Games

  • Patricia Bouyer
  • Piotr Hofman
  • Nicolas Markey
  • Mickael RandourEmail author
  • Martin Zimmermann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10203)


We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, decidability of average-energy games with a lower-bound constraint on the energy level (but no upper bound) remained open; in particular, so far there was no known upper bound on the memory that is required for winning strategies.

By reducing average-energy games with lower-bounded energy to infinite-state mean-payoff games and analyzing the density of low-energy configurations, we show an almost tight doubly-exponential upper bound on the necessary memory, and prove that the winner of average-energy games with lower-bounded energy can be determined in doubly-exponential time. We also prove Open image in new window -hardness of this problem.

Finally, we consider multi-dimensional extensions of all types of average-energy games: without bounds, with only a lower bound, and with both a lower and an upper bound on the energy. We show that the fully-bounded version is the only case to remain decidable in multiple dimensions.


  1. 1.
    Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 140–156. Springer, Heidelberg (2009). doi: 10.1007/978-3-642-02658-4_14 CrossRefGoogle Scholar
  2. 2.
    Boros, E., Elbassioni, K., Gurvich, V., Makino, K.: Markov decision processes and stochastic games with total effective payoff. In: Mayr , E.W., Ollinger, N. (eds.) STACS 2015, LIPics, vol. 30, pp. 103–115. Leibniz-Zentrum für Informatik (2015)Google Scholar
  3. 3.
    Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Srba, J.: Infinite runs in weighted timed automata with energy constraints. In: Cassez, F., Jard, C. (eds.) FORMATS 2008. LNCS, vol. 5215, pp. 33–47. Springer, Heidelberg (2008). doi: 10.1007/978-3-540-85778-5_4 CrossRefGoogle Scholar
  4. 4.
    Bouyer, P., Hofman, P., Markey, N., Randour, M., Zimmermann, M.: Bounding average-energy games. arXiv:1610.07858 (2016)
  5. 5.
    Bouyer, P., Markey, N., Randour, M., Larsen, K.G., Laursen, S.: Average-energy games. Acta Informatica (2016, in press)Google Scholar
  6. 6.
    Brim, L., Chaloupka, J., Doyen, L., Gentilini, R., Raskin, J.-F.: Faster algorithms for mean-payoff games. Formal Methods Syst. Des. 38(2), 97–118 (2011)CrossRefzbMATHGoogle Scholar
  7. 7.
    Cassez, F., Jessen, J.J., Larsen, K.G., Raskin, J.-F., Reynier, P.-A.: Automatic synthesis of robust and optimal controllers – an industrial case study. In: Majumdar, R., Tabuada, P. (eds.) HSCC 2009. LNCS, vol. 5469, pp. 90–104. Springer, Heidelberg (2009). doi: 10.1007/978-3-642-00602-9_7 CrossRefGoogle Scholar
  8. 8.
    Chakrabarti, A., Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource interfaces. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, pp. 117–133. Springer, Heidelberg (2003). doi: 10.1007/978-3-540-45212-6_9 CrossRefGoogle Scholar
  9. 9.
    Chatterjee, K., Doyen, L.: Energy parity games. Theor. Comput. Sci. 458, 49–60 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Chatterjee, K., Doyen, L., Randour, M., Raskin, J.-F.: Looking at mean-payoff and total-payoff through windows. Inf. Comput. 242, 25–52 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Chatterjee, K., Randour, M., Raskin, J.-F.: Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica 51(3–4), 129–163 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Chatterjee, K., Velner, Y.: Mean-payoff pushdown games. In: LICS 2012, pp. 195–204. IEEE Computer Society (2012)Google Scholar
  13. 13.
    Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. J. Game Theor. 8(2), 109–113 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Fearnley, J., Jurdzinski, M.: Reachability in two-clock timed automata is PSPACE-complete. Inf. Comput. 243, 26–36 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Fridman, W., Zimmermann, M.: Playing pushdown parity games in a hurry. In: Faella, M., Murano, A. (eds.) GandALF 2012, EPTCS, vol. 96, pp. 183–196 (2012)Google Scholar
  16. 16.
    Hunter, P.: Reachability in succinct one-counter games. arXiv:1407.1996 (2014)
  17. 17.
    Hunter, P.: Reachability in succinct one-counter games. In: Bojańczyk, M., Lasota, S., Potapov, I. (eds.) RP 2015. LNCS, vol. 9328, pp. 37–49. Springer, Cham (2015). doi: 10.1007/978-3-319-24537-9_5 CrossRefGoogle Scholar
  18. 18.
    Juhl, L., Larsen, K.G., Raskin, J.-F.: Optimal bounds for multiweighted and parametrised energy games. In: Liu, Z., Woodcock, J., Zhu, H. (eds.) Theories of Programming and Formal Methods. LNCS, vol. 8051, pp. 244–255. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  19. 19.
    Jurdziński, M., Lazić, R., Schmitz, S.: Fixed-dimensional energy games are in pseudo-polynomial time. In: Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 260–272. Springer, Heidelberg (2015). doi: 10.1007/978-3-662-47666-6_21 Google Scholar
  20. 20.
    Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Math. 23(3), 309–3011 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Larsen, K.G., Laursen, S., Zimmermann, M.: Limit your consumption! Finding bounds in average-energy games. In: Tribastone, M., Wiklicky, B. (eds.), Proceedings 14th International Workshop Quantitative Aspects of Programming Languages and Systems, QAPL 2016, EPTCS, Eindhoven, The Netherlands, vol. 227, pp. 1–14, 2–3 April 2016Google Scholar
  22. 22.
    Niskanen, R., Potapov, I., Reichert, J.: Undecidability of two-dimensional robot games. In: Faliszewski, P., Muscholl, A., Niedermeier, R. (eds.) MFCS 2016, LIPIcs, vol. 58, pp. 73:1–73:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)Google Scholar
  23. 23.
    Randour, M.: Automated synthesis of reliable and efficient systems through game theory: a case study. In: Gilbert, T., Kirkilionis, M., Nicolis, G. (eds.) ECCS 2012, Springer Proceedings in Complexity, pp. 731–738. Springer, Heidelberg (2013)Google Scholar
  24. 24.
    Thuijsman, F., Vrieze, O.J.: The bad match; a total reward stochastic game. OR Spektrum 9(2), 93–99 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T.A., Rabinovich, A., Raskin, J.-F.: The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241, 177–196 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Walukiewicz, I.: Pushdown processes: games and model-checking. Inf. Comput. 164(2), 234–263 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158(1–2), 343–359 (1996)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany 2017

Authors and Affiliations

  • Patricia Bouyer
    • 1
  • Piotr Hofman
    • 1
    • 2
  • Nicolas Markey
    • 1
    • 3
  • Mickael Randour
    • 4
    Email author
  • Martin Zimmermann
    • 5
  1. 1.LSV, CNRS & ENS CachanUniversité Paris SaclayCachanFrance
  2. 2.University of WarsawWarszawaPoland
  3. 3.IRISA, CNRS & INRIA & U. Rennes 1RennesFrance
  4. 4.Computer Science DepartmentULB - Université Libre de BruxellesBrusselsBelgium
  5. 5.Reactive Systems GroupSaarland UniversitySaarbrückenGermany

Personalised recommendations