---
res:
bibo_abstract:
- Games played on graphs may have qualitative objectives, such as the satisfaction
of an ω-regular property, or quantitative objectives, such as the optimization
of a real-valued reward. When games are used to model reactive systems with both
fairness assumptions and quantitative (e.g., resource) constraints, then the corresponding
objective combines both a qualitative and a quantitative component. In a general
case of interest, the qualitative component is a parity condition and the quantitative
component is a mean-payoff reward. We study and solve such mean-payoff parity
games. We also prove some interesting facts about mean-payoff parity games which
distinguish them both from mean-payoff and from parity games. In particular, we
show that optimal strategies exist in mean-payoff parity games, but they may require
infinite memory.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Krishnendu
foaf_name: Krishnendu Chatterjee
foaf_surname: Chatterjee
foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-4561-241X
- foaf_Person:
foaf_givenName: Thomas A
foaf_name: Thomas Henzinger
foaf_surname: Henzinger
foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
orcid: 0000−0002−2985−7724
- foaf_Person:
foaf_givenName: Marcin
foaf_name: Jurdziński, Marcin
foaf_surname: Jurdziński
bibo_doi: 10.1109/LICS.2005.26
dct_date: 2005^xs_gYear
dct_publisher: IEEE@
dct_title: Mean-payoff parity games@
...