Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li & Frank Stephan (2017):
Deciding parity games in quasipolynomial time.
In: STOC,
pp. 252–263,
doi:10.1145/3055399.3055409.
Krishnendu Chatterjee, Thomas A. Henzinger & Marcin Jurdziński (2005):
Mean-Payoff Parity Games.
In: LICS,
pp. 178–187,
doi:10.1109/LICS.2005.26.
Krishnendu Chatterjee, Thomas A. Henzinger & Nir Piterman (2007):
Generalized Parity Games.
In: Helmut Seidl: FoSSaCS,
Lecture Notes in Computer Science 4423.
Springer,
pp. 153–167,
doi:10.1007/978-3-540-71389-0_12.
Thomas Colcombet & Nathanaël Fijalkow (2018):
Parity games and universal graphs.
CoRR abs/1810.05106.
Available at https://arxiv.org/abs/1810.05106.
Thomas Colcombet & Nathanaël Fijalkow (2019):
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games.
In: FoSSaCS,
doi:10.1007/978-3-030-17127-8_1.
Wojciech Czerwiński, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdziński, Ranko Lazi\'c & PawełParys (2019):
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games.
In: SODA,
doi:10.1137/1.9781611975482.142.
Laure Daviaud, Marcin Jurdziński & Ranko Lazi\'c (2018):
A pseudo-quasi-polynomial algorithm for mean-payoff parity games.
In: LICS,
doi:10.1145/3209108.3209162.
Nathanaël Fijalkow (2018):
An Optimal Value Iteration Algorithm for Parity Games.
CoRR abs/1801.09618.
Available at https://arxiv.org/abs/1801.09618.
Nathanaël Fijalkow, PawełGawrychowski & Pierre Ohlmann (2020):
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games.
In: MFCS,
doi:10.4230/LIPIcs.MFCS.2020.34.
Nathanaël Fijalkow & Martin Zimmermann (2014):
Parity and Streett Games with Costs.
Logical Methods in Computer Science 10(2),
doi:10.2168/LMCS-10(2:14)2014.
Marcin Jurdziński & Ranko Lazi\'c (2017):
Succinct progress measures for solving parity games.
In: LICS,
doi:10.1109/LICS.2017.8005092.
Eryk Kopczyński (2006):
Half-Positional Determinacy of Infinite Games.
In: ICALP,
pp. 336–347,
doi:10.1007/11787006_29.
Sven Schewe, Alexander Weinert & Martin Zimmermann (2019):
Parity Games with Weights.
Logical Methods in Computer Science 15(3),
doi:10.23638/LMCS-15(3:20)2019.
Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander M. Rabinovich & Jean-François Raskin (2015):
The complexity of multi-mean-payoff and multi-energy games.
Information and Computation 241,
pp. 177–196,
doi:10.1016/j.ic.2015.03.001.
eptcs@eptcs.org