A. Chakrabarti, L. de Alfaro, T.A. Henzinger, and M. Stoelinga Resource interfaces Proc. of EMSOFT LNCS vol. 2855 2003 Springer 117 133
A. Ehrenfeucht, and J. Mycielski Positional strategies for mean payoff games Int. J. Game Theory 8 2 1979 109 113
H. Gimbert, and W. Zielonka When can you play positionally? Proc. of MFCS LNCS vol. 3153 2004 Springer 686 697
Y. Velner, and A. Rabinovich Church synthesis problem for noisy input Proc. of FOSSACS LNCS vol. 6604 2011 Springer 275 289
K. Chatterjee, L. Doyen, T.A. Henzinger, and J.-F. Raskin Generalized mean-payoff and energy games Proc. of FSTTCS LIPIcs vol. 8 2010 Schloss Dagstuhl - LZI 505 516
R. Alur, and T.A. Henzinger Finitary fairness ACM Trans. Program. Lang. Syst. 20 6 1998 1171 1194
K. Chatterjee, and T.A. Henzinger Finitary winning in omega-regular games Proc. of TACAS LNCS vol. 3920 2006 Springer 257 271
K. Chatterjee, T.A. Henzinger, and F. Horn Finitary winning in omega-regular games ACM Trans. Comput. Log. 11 1 2009 1 27
K. Chatterjee, and N. Fijalkow Infinite-state games with finitary conditions Proc. of CSL LIPIcs vol. 8 2013 Schloss Dagstuhl - LZI 181 196
O. Kupferman, N. Piterman, and M.Y. Vardi From liveness to promptness Form. Methods Syst. Des. 34 2 2009 83 103
A. Bohy, V. Bruyère, E. Filiot, and J.-F. Raskin Synthesis from LTL specifications with mean-payoff objectives Proc. of TACAS LNCS vol. 7795 2013 Springer 169 184
K. Chatterjee, L. Doyen, M. Randour, and J.-F. Raskin Looking at mean-payoff and total-payoff through windows Proc. of ATVA LNCS vol. 8172 2013 Springer 118 132
A.V. Karzanov, and V.N. Lebedev Cyclical games with prohibitions Math. Program. 60 1993 277 293
U. Zwick, and M. Paterson The complexity of mean payoff games on graphs Theor. Comput. Sci. 158 1996 343 359
M. Jurdziński Deciding the winner in parity games is in UP ∩ co-UP Inf. Process. Lett. 68 3 1998 119 124
V.A. Gurvich, A.V. Karzanov, and L. Khachivan Cyclic games and an algorithm to find minimax cycle means in directed graphs USSR Comput. Math. Math. Phys. 28 5 1988 85 91
N.N. Pisaruk Mean cost cyclical games Math. Oper. Res. 24 4 1999 817 828
Y.M. Lifshits, and D.S. Pavlov Potential theory for mean payoff games J. Math. Sci. 145 3 2007 4967 4974
H. Björklund, and S.G. Vorobyov A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games Discrete Appl. Math. 155 2007 210 229
L. Brim, J. Chaloupka, L. Doyen, R. Gentilini, and J.-F. Raskin Faster algorithms for mean-payoff games Form. Methods Syst. Des. 38 2 2011 97 118
K. Chatterjee, M. Henzinger, S. Krinninger, and D. Nanongkai Polynomial-time algorithms for energy games with special weight structures Algorithmica 70 3 2014 457 492
R.M. Karp, A characterization of the minimum cycle mean in a digraph, Discrete Math.
K. Chatterjee, M. Henzinger, S. Krinninger, V. Loitzenbauer, and M.A. Raskin Approximating the minimum cycle mean Theor. Comput. Sci. 547 2014 104 116
V. Bruyère, E. Filiot, M. Randour, and J.-F. Raskin Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games Proc. of STACS LIPIcs vol. 25 2014 Schloss Dagstuhl - LZI 199 213
K. Chatterjee, M. Randour, and J.-F. Raskin Strategy synthesis for multi-dimensional quantitative objectives Acta Inform. 51 3-4 2014 129 163
T. Gawlitza, and H. Seidl Games through nested fixpoints Proc. of CAV LNCS vol. 5643 2009 Springer 291 305
T.M. Liggett, and S.A. Lippman Stochastic games with perfect information and time average payoff SIAM Rev. 11 4 1969 604 607
J. Filar, and K. Vrieze Competitive Markov Decision Processes 1997 Springer
Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, and J.-F. Raskin The complexity of multi-mean-payoff and multi-energy games CoRR arXiv:1209.3234 2012 pp. 1-27
M.L. Minsky Recursive unsolvability of Post's problem of "tag" and other topics in theory of Turing machines Ann. Math. 74 3 1961 437 455
D.A. Martin Borel determinacy Ann. Math. 102 2 1975 363 371
K. Chatterjee, and M. Henzinger Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition J. ACM 61 3 2014 15
A.K. Chandra, D. Kozen, and L.J. Stockmeyer Alternation J. ACM 28 1 1981 114 133
M. Jurdziński, J. Sproston, and F. Laroussinie Model checking probabilistic timed automata with one or two clocks Log. Methods Comput. Sci. 4 3 2008 1 28
N. Fijalkow, and F. Horn The surprizing complexity of generalized reachability games CoRR arXiv:1010.2420 2010 pp. 1-15
E.A. Emerson, and C.S. Jutla Tree automata, mu-calculus and determinacy Proc. of FOCS 1991 IEEE Computer Society 368 377
W. Ackermann Zum hilbertschen aufbau der reellen zahlen Math. Ann. 99 1 1928 118 133
C. Dufourd, A. Finkel, and P. Schnoebelen Reset nets between decidability and undecidability Proc. of ICALP LNCS vol. 1443 1998 Springer 103 115
P. Schnoebelen Verifying lossy channel systems has nonprimitive recursive complexity Inf. Process. Lett. 83 5 2002 251 261
R. Lazic, T. Newcomb, J. Ouaknine, A.W. Roscoe, and J. Worrell Nets with tokens which carry data Fundam. Inform. 88 3 2008 251 274
