---
res:
  bibo_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 objective. 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 polynomially 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.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Chatterjee, Krishnendu
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - foaf_Person:
      foaf_givenName: Laurent
      foaf_name: Doyen, Laurent
      foaf_surname: Doyen
  bibo_doi: 10.1007/978-3-642-14162-1_50
  bibo_volume: 6199
  dct_date: 2010^xs_gYear
  dct_language: eng
  dct_publisher: Springer@
  dct_title: Energy parity games@
...