Parity Games with Weights

Authors Sven Schewe, Alexander Weinert, Martin Zimmermann

Thumbnail PDF


  • Filesize: 0.51 MB
  • 17 pages

Document Identifiers

Author Details

Sven Schewe
  • University of Liverpool, Liverpool L69 3BX, United Kingdom
Alexander Weinert
  • Reactive Systems Group, Saarland University, 66123 Saarbrücken, Germany
Martin Zimmermann
  • Reactive Systems Group, Saarland University, 66123 Saarbrücken, Germany

Cite AsGet BibTex

Sven Schewe, Alexander Weinert, and Martin Zimmermann. Parity Games with Weights. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 119, pp. 36:1-36:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Quantitative extensions of parity games have recently attracted significant interest. These extensions include parity games with energy and payoff conditions as well as finitary parity games and their generalization to parity games with costs. Finitary parity games enjoy a special status among these extensions, as they offer a native combination of the qualitative and quantitative aspects in infinite games: the quantitative aspect of finitary parity games is a quality measure for the qualitative aspect, as it measures the limit superior of the time it takes to answer an odd color by a larger even one. Finitary parity games have been extended to parity games with costs, where each transition is labelled with a non-negative weight that reflects the costs incurred by taking it. We lift this restriction and consider parity games with costs with arbitrary integer weights. We show that solving such games is in NP cap co-NP, the signature complexity for games of this type. We also show that the protagonist has finite-state winning strategies, and provide tight exponential bounds for the memory he needs to win the game. Naturally, the antagonist may need infinite memory to win. Finally, we present tight bounds on the quality of winning strategies for the protagonist.

Subject Classification

ACM Subject Classification
  • Theory of computation → Automata over infinite objects
  • Infinite Games
  • Quantitative Games
  • Parity Games


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Henrik Björklund and Sergei Vorobyov. A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discrete Appl. Math., 155(2):210-229, 2007. URL:
  2. Anca Browne, Edmund M. Clarke, Somesh Jha, David E. Long, and Wilfredo R. Marrero. An improved algorithm for the evaluation of fixpoint expressions. Theo. Comp. Sci., 178(1-2):237-255, 1997. URL:
  3. C. S. Calude, S. Jain, B. Khoussainov, W. Li, and F. Stephan. Deciding parity games in quasipolynomial time. In STOC 2017, pages 252-263. ACM Press, 2017. URL:
  4. Krishnendu Chatterjee and Laurent Doyen. Energy Parity Games. Theo. Comp. Sci., 458:49-60, 2012. URL:
  5. Krishnendu Chatterjee and Nathanaël Fijalkow. Infinite-state games with finitary conditions. In CSL 2013, volume 23 of LIPIcs, pages 181-196. Schloss Dagstuhl-LZI, 2013. URL:
  6. Krishnendu Chatterjee and Thomas A. Henzinger. Finitary winning in omega-regular games. In Holger Hermanns and Jens Palsberg, editors, TACAS 2006, volume 3920 of LNCS, pages 257-271, 2006. URL:
  7. Krishnendu Chatterjee, Thomas A. Henzinger, and Florian Horn. Finitary winning in omega-regular games. Trans. Comput. Log., 11(1):1:1-1:27, 2009. URL:
  8. Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdzinski. Mean-payoff parity games. In LICS 2005, pages 178-187. IEEE Computer Society, 2005. URL:
  9. Anne Condon. On algorithms for simple stochastic games. In Advances in Computational Complexity Theory, pages 51-73. American Mathematical Society, 1993. Google Scholar
  10. Laure Daviaud, Marcin Jurdzinski, and Ranko Lazic. A pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. In LICS 2018, page (to appear), 2018. Google Scholar
  11. E. Allen Emerson and Charanjit S. Jutla. Tree automata, μ-calculus and determinacy. In FOCS 1991, pages 368-377. IEEE Computer Society, 1991. Google Scholar
  12. E. Allen Emerson and Chin-Laung Lei. Efficient model checking in fragments of the propositional μ-calculus. In LICS 1986, pages 267-278. IEEE Computer Society, 1986. URL:
  13. John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan, and Dominik Wojtczak. An ordered approach to solving parity games in quasi polynomial time and quasi linear space. In SPIN 2017, pages 112-121. ACM, 2017. URL:
  14. Nathanaël Fijalkow and Martin Zimmermann. Parity and Streett games with costs. LMCS, 10(2), 2014. URL:
  15. Marcin Jurdziński. Deciding the winner in parity games is in UP ∩ co-UP. Information Processing Letters, 68(3):119-124, November 1998. URL:
  16. Marcin Jurdziński. Small progress measures for solving parity games. In STACS 2000, volume 1770 of LNCS, pages 290-301, 2000. URL:
  17. Marcin Jurdziński and Ranko Lazić. Succinct progress measures for solving parity games. In LICS 2017, pages 1-9. IEEE Computer Society, 2017. URL:
  18. Marcin Jurdziński, Mike Paterson, and Uri Zwick. A deterministic subexponential algorithm for solving parity games. SIAM J. on Comp., 38(4):1519-1532, 2008. URL:
  19. Dexter Kozen. Results on the propositional μ-calculus. Theo. Comp. Sci., 27:333-354, 1983. URL:
  20. Karoliina Lehtinen. A modal μ perspective on solving parity games in quasipolynomial time. In LICS 2018, page (to appear), 2018. Google Scholar
  21. Robert McNaughton. Infinite games played on finite graphs. Ann. Pure Appl. Logic, 65(2):149-184, 1993. URL:
  22. Fabio Mogavero, Aniello Murano, and Loredana Sorrentino. On promptness in parity games. Fundam. Inform., 139(3):277-305, 2015. URL:
  23. Anil Nerode, Jeffrey B. Remmel, and Alexander Yakhnis. Mcnaughton games and extracting strategies for concurrent programs. Ann. Pure Appl. Logic, 78(1-3):203-242, 1996. URL:
  24. Anuj Puri. Theory of hybrid systems and discrete event systems. PhD thesis, Computer Science Department, University of California, Berkeley, 1995. Google Scholar
  25. Sven Schewe. An optimal strategy improvement algorithm for solving parity and payoff games. In CSL 2008, volume 5213 of LNCS, pages 368-383, 2008. URL:
  26. Sven Schewe. Solving parity games in big steps. J. of Comp. and Sys. Sci., 84:243-262, 2017. URL:
  27. Sven Schewe, Ashutosh Trivedi, and Thomas Varghese. Symmetric strategy improvement. In ICALP 2015, volume 9135 of LNCS, pages 388-400, 2015. URL:
  28. Sven Schewe, Alexander Weinert, and Martin Zimmermann. Parity games with weights. CoRR, abs/1804.06168, 2018. URL:
  29. Jens Vöge and Marcin Jurdziński. A discrete strategy improvement algorithm for solving parity games. In CAV 2000, pages 202-215. Springer, 2000. URL:
  30. Alexander Weinert and Martin Zimmermann. Easy to win, hard to master: Optimal strategies in parity games with costs. LMCS, 13(3), 2017. URL:
  31. Wieslaw Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theo. Comp. Sci., 200(1-2):135-183, 1998. URL:
  32. Uri Zwick and Mike S. Paterson. The complexity of mean payoff games on graphs. Theo. Comp. Sci., 158(1-2):343-359, 1996. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail