Algorithmica

, Volume 70, Issue 3, pp 457–492 | Cite as

Polynomial-Time Algorithms for Energy Games with Special Weight Structures

  • Krishnendu Chatterjee
  • Monika Henzinger
  • Sebastian Krinninger
  • Danupon Nanongkai
Article

Abstract

Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NPco-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time.

In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help.

Keywords

Graph algorithms Polynomial-time algorithms Turn-based infinite duration games Energy games Mean-payoff games 

References

  1. 1.
    Beffara, E., Vorobyov, S.: Is randomized Gurvich-Karzanov-Khachiyan’s algorithm for parity games polynomial? Tech. Rep. 2001-025, Department of Information Technology, Uppsala University (2001) Google Scholar
  2. 2.
    Björklund, H., Vorobyov, S.G.: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discrete Appl. Math. 155(2), 210–229 (2007) MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: CAV, pp. 140–156 (2009) Google Scholar
  4. 4.
    Boros, E., Elbassioni, K., Gurvich, V., Makino, K.: On canonical forms for zero-sum stochastic mean payoff games. Dyn. Games Appl. (2013, to appear) Google Scholar
  5. 5.
    Boros, E., Elbassioni, K.M., Fouz, M., Gurvich, V., Makino, K., Manthey, B.: Stochastic mean payoff games: smoothed analysis and approximation schemes. In: ICALP, pp. 147–158 (2011) Google Scholar
  6. 6.
    Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N., Srba, J.: Infinite runs in weighted timed automata with energy constraints. In: FORMATS, pp. 33–47 (2008) Google Scholar
  7. 7.
    Brim, L., Chaloupka, J., Doyen, L., Gentilini, R., Raskin, J.F.: Faster algorithms for mean-payoff games. Form. Methods Syst. Des. 38(2), 97–118 (2011) MATHCrossRefGoogle Scholar
  8. 8.
    Cerný, P., Chatterjee, K., Henzinger, T.A., Radhakrishna, A., Singh, R.: Quantitative synthesis for concurrent programs. In: CAV, pp. 243–259 (2011) Google Scholar
  9. 9.
    Chakrabarti, A., de Alfaro, L., Henzinger, T.A., Stoelinga, M.: Resource interfaces. In: EMSOFT, pp. 117–133 (2003) Google Scholar
  10. 10.
    Condon, A.: The complexity of stochastic games. Inf. Comput. 96(2), 203–224 (1992) MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101(1–3), 77–114 (2000) MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Daskalakis, C., Papadimitriou, C.H.: Continuous local search. In: SODA, pp. 790–804 (2011) Google Scholar
  13. 13.
    Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. J. Game Theory 8(2), 109–113 (1979) MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Friedmann, O.: A subexponential lower bound for Zadeh’s pivoting rule for solving linear programs and games. In: IPCO, pp. 192–206 (2011) Google Scholar
  15. 15.
    Friedmann, O., Hansen, T.D., Zwick, U.: A subexponential lower bound for the random facet algorithm for parity games. In: SODA, pp. 202–216 (2011) Google Scholar
  16. 16.
    Friedmann, O., Hansen, T.D., Zwick, U.: Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. In: STOC, pp. 283–292 (2011) Google Scholar
  17. 17.
    Gentilini, R.: A note on the approximation of mean-payoff games. In: CILC (2011) Google Scholar
  18. 18.
    Gurvich, V.A., Karzanov, A.V., Khachiyan, L.G.: Cyclic games and an algorithm to find minimax cycle means in directed graphs. USSR Comput. Math. Math. Phys. 28(5), 85–91 (1990) CrossRefMathSciNetGoogle Scholar
  19. 19.
    Halman, N.: Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems. Algorithmica 49(1), 37–50 (2007) MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Jurdzinski, M.: Deciding the winner in parity games is in UPco-UP. Inf. Process. Lett. 68(3), 119–124 (1998) CrossRefMathSciNetGoogle Scholar
  21. 21.
    Kalai, G.: A subexponential randomized simplex algorithm. In: STOC, pp. 475–482 (1992) Google Scholar
  22. 22.
    Kalai, G.: Linear programming, the simplex algorithm and simple polytopes. Math. Program. 79(1–3), 217–233 (1997) MATHMathSciNetGoogle Scholar
  23. 23.
    Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Math. 23(3), 309–311 (1978) MATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    Lebedev, V.N.: Effectively solvable classes of cyclical games. J. Comput. Syst. Sci. Int. 44(4), 525–530 (2005) MATHGoogle Scholar
  25. 25.
    Lifshits, Y.M., Pavlov, D.S.: Potential theory for mean payoff games. J. Math. Sci. 145(3), 4967–4974 (2007) CrossRefMathSciNetGoogle Scholar
  26. 26.
    Martin, D.A.: Borel determinacy. Ann. Math. 102(2), 363–371 (1975) MATHGoogle Scholar
  27. 27.
    Matoušek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16(4–5), 498–516 (1996) MATHMathSciNetGoogle Scholar
  28. 28.
    Obdrzálek, J.: Clique-width and parity games. In: CSL, pp. 54–68 (2007) Google Scholar
  29. 29.
    Pisaruk, N.N.: Mean cost cyclical games. Math. Oper. Res. 24(4), 817–828 (1999) MATHMathSciNetGoogle Scholar
  30. 30.
    Roth, A., Balcan, M.F., Kalai, A., Mansour, Y.: On the equilibria of alternating move games. In: SODA, pp. 805–816 (2010) Google Scholar
  31. 31.
    Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. In: STACS, pp. 569–579 (1992) Google Scholar
  32. 32.
    Vorobyov, S.: Cyclic games and linear programming. Discrete Appl. Math. 156(11), 2195–2231 (2008) MATHMathSciNetGoogle Scholar
  33. 33.
    Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158(1–2), 343–359 (1996) MATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Krishnendu Chatterjee
    • 1
  • Monika Henzinger
    • 2
  • Sebastian Krinninger
    • 2
  • Danupon Nanongkai
    • 3
  1. 1.Institute of Science and TechnologyKlosterneuburgAustria
  2. 2.University of Vienna, Faculty of Computer ScienceViennaAustria
  3. 3.Nanyang Technological UniversitySingaporeSingapore

Personalised recommendations