@inproceedings{4554,
  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.},
  author       = {Chatterjee, Krishnendu and Henzinger, Thomas A and Jurdziński, Marcin},
  booktitle    = {Proceedings. 20th Annual IEEE Symposium on Logic in Computer Science},
  isbn         = {0769522661},
  issn         = {1043-6871},
  location     = {Chicago, IL, United States},
  pages        = {178 -- 187},
  publisher    = {IEEE},
  title        = {{Mean-payoff parity games}},
  doi          = {10.1109/LICS.2005.26},
  year         = {2005},
}