{"publist_id":"159","type":"conference","publication_status":"published","extern":1,"publisher":"IEEE","citation":{"ieee":"K. Chatterjee, T. A. Henzinger, and M. Jurdziński, “Mean-payoff parity games,” presented at the LICS: Logic in Computer Science, 2005, pp. 178–187.","short":"K. Chatterjee, T.A. Henzinger, M. Jurdziński, in:, IEEE, 2005, pp. 178–187.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Jurdziński, M. (2005). Mean-payoff parity games (pp. 178–187). Presented at the LICS: Logic in Computer Science, IEEE. <a href=\"https://doi.org/10.1109/LICS.2005.26\">https://doi.org/10.1109/LICS.2005.26</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziński. “Mean-Payoff Parity Games,” 178–87. IEEE, 2005. <a href=\"https://doi.org/10.1109/LICS.2005.26\">https://doi.org/10.1109/LICS.2005.26</a>.","ama":"Chatterjee K, Henzinger TA, Jurdziński M. Mean-payoff parity games. In: IEEE; 2005:178-187. doi:<a href=\"https://doi.org/10.1109/LICS.2005.26\">10.1109/LICS.2005.26</a>","mla":"Chatterjee, Krishnendu, et al. <i>Mean-Payoff Parity Games</i>. IEEE, 2005, pp. 178–87, doi:<a href=\"https://doi.org/10.1109/LICS.2005.26\">10.1109/LICS.2005.26</a>.","ista":"Chatterjee K, Henzinger TA, Jurdziński M. 2005. Mean-payoff parity games. LICS: Logic in Computer Science, 178–187."},"month":"09","abstract":[{"lang":"eng","text":"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."}],"status":"public","date_published":"2005-09-19T00:00:00Z","conference":{"name":"LICS: Logic in Computer Science"},"author":[{"full_name":"Krishnendu Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Thomas Henzinger"},{"full_name":"Jurdziński, Marcin","first_name":"Marcin","last_name":"Jurdziński"}],"date_updated":"2021-01-12T07:59:39Z","date_created":"2018-12-11T12:09:27Z","title":"Mean-payoff parity games","page":"178 - 187","_id":"4554","day":"19","year":"2005","quality_controlled":0,"doi":"10.1109/LICS.2005.26"}