Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero, “Solving mean-payoff games via quasi dominions”, Information and Computation, 297 (2024), 105151
Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero, “Solving Mean-Payoff Games Via Quasi Dominions”, SSRN Journal, 2022
Carlo Comin, Romeo Rizzi, “Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games”, Algorithmica, 77:4 (2017), 995
Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin, “Looking at mean-payoff and total-payoff through windows”, Information and Computation, 242 (2015), 25
И. А. Башлаева, Т. В. Штельмах, “Некоторые вопросы сложности решения циклических игр на графах”, Вестн. Волгогр. гос. ун-та. Сер. 1, Мат. Физ., 2014, № 2(21), 31–41
Raffaella Gentilini, “A note on the approximation of mean-payoff games”, Information Processing Letters, 114:7 (2014), 382
Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, “Polynomial-Time Algorithms for Energy Games with Special Weight Structures”, Algorithmica, 70:3 (2014), 457
Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin, Lecture Notes in Computer Science, 8172, Automated Technology for Verification and Analysis, 2013, 118
Yaron Velner, Lecture Notes in Computer Science, 7965, Automata, Languages, and Programming, 2013, 816
Brim L., Chaloupka J., Doyen L., Gentilini R., Raskin J.F., “Faster algorithms for mean-payoff games”, Formal Methods in System Design, 38:2 (2011), 97–118
Chaloupka J., “Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation”, Algorithms - ESA 2009, Proceedings, Lecture Notes in Computer Science, 5757, 2009, 599–610
