@inproceedings{ChatterjeeHenzingerJurdzinski2005,
  author = {Chatterjee, Krishnendu and Henzinger, Thomas A. and Jurdzi{\'n}ski, Marcin},
  title = {Mean-Payoff Parity Games},
  booktitle = {20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005)},
  pages = {178--187},
  publisher = {IEEE Computer Society},
  year = {2005},
  doi = {10.1109/LICS.2005.26},
  note = {\href{https://doi.org/10.1109/LICS.2005.26}{DOI: \nolinkurl{10.1109/LICS.2005.26}}}
}

@inproceedings{BouyerMarkeyOlschewskiUmmels2011,
  author = {Bouyer, Patricia and Markey, Nicolas and Olschewski, J{\"o}rg and Ummels, Michael},
  title = {Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited},
  booktitle = {Automated Technology for Verification and Analysis (ATVA 2011)},
  series = {Lecture Notes in Computer Science},
  volume = {6996},
  pages = {135--149},
  publisher = {Springer},
  year = {2011},
  doi = {10.1007/978-3-642-24372-1_11},
  note = {\href{https://doi.org/10.1007/978-3-642-24372-1_11}{DOI: \nolinkurl{10.1007/978-3-642-24372-1_11}}. Full version: \href{https://arxiv.org/abs/1102.3615v2}{arXiv:1102.3615v2}}
}

@article{ChatterjeeDoyen2012,
  author = {Chatterjee, Krishnendu and Doyen, Laurent},
  title = {Energy parity games},
  journal = {Theoretical Computer Science},
  volume = {458},
  pages = {49--60},
  year = {2012},
  doi = {10.1016/j.tcs.2012.07.038},
  note = {\href{https://doi.org/10.1016/j.tcs.2012.07.038}{DOI: \nolinkurl{10.1016/j.tcs.2012.07.038}}}
}

@inproceedings{ChatterjeeHenzingerSvozil2017,
  author = {Chatterjee, Krishnendu and Henzinger, Monika and Svozil, Alexander},
  title = {Faster Algorithms for Mean-Payoff Parity Games},
  booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  volume = {83},
  pages = {39:1--39:14},
  publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  year = {2017},
  doi = {10.4230/LIPIcs.MFCS.2017.39},
  note = {\href{https://doi.org/10.4230/LIPIcs.MFCS.2017.39}{DOI: \nolinkurl{10.4230/LIPIcs.MFCS.2017.39}}. Full version: \href{https://arxiv.org/abs/1706.06139}{arXiv:1706.06139}}
}

@inproceedings{CaludeEtAl2017,
  author = {Calude, Cristian S. and Jain, Sanjay and Khoussainov, Bakhadyr and Li, Wei and Stephan, Frank},
  title = {Deciding Parity Games in Quasipolynomial Time},
  booktitle = {Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC 2017)},
  pages = {252--263},
  publisher = {ACM},
  year = {2017},
  doi = {10.1145/3055399.3055409},
  note = {\href{https://doi.org/10.1145/3055399.3055409}{DOI: \nolinkurl{10.1145/3055399.3055409}}}
}

@inproceedings{JurdzinskiLazic2017,
  author = {Jurdzi{\'n}ski, Marcin and Lazi{\'c}, Ranko},
  title = {Succinct progress measures for solving parity games},
  booktitle = {32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2017)},
  pages = {1--9},
  publisher = {IEEE},
  year = {2017},
  doi = {10.1109/LICS.2017.8005092},
  note = {\href{https://doi.org/10.1109/LICS.2017.8005092}{DOI: \nolinkurl{10.1109/LICS.2017.8005092}}}
}

@inproceedings{DaviaudJurdzinskiLazic2018,
  author = {Daviaud, Laure and Jurdzi{\'n}ski, Marcin and Lazi{\'c}, Ranko},
  title = {A Pseudo-Quasi-Polynomial Algorithm for Mean-Payoff Parity Games},
  booktitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018)},
  pages = {325--334},
  publisher = {ACM},
  year = {2018},
  doi = {10.1145/3209108.3209162},
  note = {\href{https://doi.org/10.1145/3209108.3209162}{DOI: \nolinkurl{10.1145/3209108.3209162}}. Full version: \href{https://arxiv.org/abs/1803.04756v3}{arXiv:1803.04756v3}}
}

@inproceedings{Parys2019,
  author = {Parys, Pawe{\l}},
  title = {Parity Games: {Zielonka's} Algorithm in Quasi-Polynomial Time},
  booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
  series = {Leibniz International Proceedings in Informatics (LIPIcs)},
  volume = {138},
  pages = {10:1--10:13},
  publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  year = {2019},
  doi = {10.4230/LIPIcs.MFCS.2019.10},
  note = {\href{https://doi.org/10.4230/LIPIcs.MFCS.2019.10}{DOI: \nolinkurl{10.4230/LIPIcs.MFCS.2019.10}}}
}

@inproceedings{AnandEtAl2021,
  author = {Anand, Ashwani and Fijalkow, Nathana{\"e}l and Goubault-Larrecq, Ali{\'e}nor and Leroux, J{\'e}r{\^o}me and Ohlmann, Pierre},
  title = {New Algorithms for Combinations of Objectives using Separating Automata},
  booktitle = {12th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 2021)},
  series = {Electronic Proceedings in Theoretical Computer Science},
  volume = {346},
  pages = {227--240},
  year = {2021},
  doi = {10.4204/EPTCS.346.15},
  note = {\href{https://doi.org/10.4204/EPTCS.346.15}{DOI: \nolinkurl{10.4204/EPTCS.346.15}}}
}

@article{LehtinenParysScheweWojtczak2022,
  author = {Lehtinen, Karoliina and Parys, Pawe{\l} and Schewe, Sven and Wojtczak, Dominik},
  title = {A Recursive Approach to Solving Parity Games in Quasipolynomial Time},
  journal = {Logical Methods in Computer Science},
  volume = {18},
  number = {1},
  pages = {8:1--8:18},
  year = {2022},
  doi = {10.46298/LMCS-18(1:8)2022},
  note = {\href{https://doi.org/10.46298/LMCS-18(1:8)2022}{DOI: \nolinkurl{10.46298/LMCS-18(1:8)2022}}}
}

@misc{OpenAI2026Deterministic,
  author = {{OpenAI}},
  title = {{Deterministic quasipolynomial-time mean-payoff games}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Deterministic-quasipolynomial-time-mean-payoff-games-September-25-2026/paper.pdf}{OAI:Deterministic-quasipolynomial-time-mean-payoff-games-September-25-2026}},
  year = {2026}
}