Energy parity games Journal Article

Author(s): Chatterjee, Krishnendu; Doyen, Laurent
Article Title: Energy parity games
Affiliation IST Austria
Abstract: Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objectives. Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is logspace-equivalent to the problem of deciding the winner in mean-payoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games.
Keywords: parity objectives; Quantitative objectives; Games on graphs
Journal Title: Theoretical Computer Science
Volume: 458
ISSN: 0304-3975
Publisher: Elsevier  
Date Published: 2012-11-01
Start Page: 49
End Page: 60
Copyright Statement: CC BY-NC-ND 3.0
DOI: 10.1016/j.tcs.2012.07.038
Notes: Open Access funded by Austrian Science Fund (FWF)
Open access: yes (OA journal)
IST Austria Authors
Related IST Austria Work