A pseudo-quasi-polynomial algorithm for mean-payoff parity games

Daviaud, Laure, Jurdziński, Martin and Lazić, Ranko (2018) A pseudo-quasi-polynomial algorithm for mean-payoff parity games. In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018. Proceedings - Symposium on Logic in Computer Science . The Institute of Electrical and Electronics Engineers (IEEE), GBR, pp. 325-334. ISBN 9781450355834

Full text not available from this repository.


In a mean-payoff parity game, one of the two players aims both to achieve a qualitative parity objective and to minimize a quantitative long-term average of payoffs (aka. mean payoff). The game is zero-sum and hence the aim of the other player is to either foil the parity objective or to maximize the mean payoff. Our main technical result is a pseudo-quasi-polynomial algorithm for solving mean-payoff parity games. All algorithms for the problem that have been developed for over a decade have a pseudo-polynomial and an exponential factors in their running times; in the running time of our algorithm the latter is replaced with a quasi-polynomial one. By the results of Chatterjee and Doyen (2012) and of Schewe, Weinert, and Zimmermann (2018), our main technical result implies that there are pseudo-quasi-polynomial algorithms for solving parity energy games and for solving parity games with weights. Our main conceptual contributions are the definitions of strategy decompositions for both players, and a notion of progress measures for mean-payoff parity games that generalizes both parity and energy progress measures. The former provides normal forms for and succinct representations of winning strategies, and the latter enables the application to mean-payoff parity games of the order-theoretic machinery that underpins a recent quasi-polynomial algorithm for solving parity games.

Item Type: Book Section
Additional Information: Funding Information: This research has been supported by the EPSRC grant EP/P020992/1 (Solving Parity Games in Theory and Practice). Publisher Copyright: © 2018 ACM.
Uncontrolled Keywords: software,mathematics(all) ,/dk/atira/pure/subjectarea/asjc/1700/1712
Related URLs:
Depositing User: LivePure Connector
Date Deposited: 08 Jun 2023 14:30
Last Modified: 08 Jun 2023 14:30
URI: https://ueaeprints.uea.ac.uk/id/eprint/92340
DOI: 10.1145/3209108.3209162

Actions (login required)

View Item View Item