L. de Alfaro (1997):
Formal verification of probabilistic systems.
Stanford University.
L. de Alfaro (1999):
Computing Minimum and Maximum Reachability Times in Probabilistic Systems.
In: Proc. of CONCUR,
LNCS 1664.
Springer,
pp. 66–81,
doi:10.1007/3-540-48320-9_7.
N. Berger, N. Kapur, L.J. Schulman & V.V. Vazirani (2008):
Solvency Games.
In: Proc. of FSTTCS,
LIPIcs 2.
Schloss Dagstuhl - LZI,
pp. 61–72,
doi:10.4230/LIPIcs.FSTTCS.2008.1741.
D.P. Bertsekas & J.N. Tsitsiklis (1991):
An analysis of stochastic shortest path problems.
Mathematics of Operations Research 16,
pp. 580–595,
doi:10.1287/moor.16.3.580.
A. Bohy, V. Bruyère & J.-F. Raskin (2014):
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.
CoRR abs/1402.1076.
Available at http://arxiv.org/abs/1402.1076.
T. Brázdil, K. Chatterjee, V. Forejt & A. Kucera (2013):
Trading Performance for Stability in Markov Decision Processes.
In: Proc. of LICS.
IEEE Computer Society,
pp. 331–340,
doi:10.1109/LICS.2013.39.
T. Brázdil, T. Chen, V. Forejt, P. Novotný & A. Simaitis (2013):
Solvency Markov Decision Processes with Interest.
In: Proc. of FSTTCS,
LIPIcs 24.
Schloss Dagstuhl - LZI,
pp. 487–499,
doi:10.4230/LIPIcs.FSTTCS.2013.487.
L. Brim, J. Chaloupka, L. Doyen, R. Gentilini & J.-F. Raskin (2011):
Faster algorithms for mean-payoff games.
Formal Methods in System Design 38(2),
pp. 97–118,
doi:10.1007/s10703-010-0105-x.
V. Bruyère, E. Filiot, M. Randour & J.-F. Raskin (2013):
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.
CoRR abs/1309.5439.
Available at http://arxiv.org/abs/1309.5439.
V. Bruyère, E. Filiot, M. Randour & J.-F. Raskin (2014):
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games.
In: Proc. of STACS,
LIPIcs 25.
Schloss Dagstuhl - LZI,
pp. 199–213.
K. Chatterjee & L. Doyen (2011):
Games and Markov Decision Processes with Mean-payoff Parity and Energy Parity Objectives.
In: Proc. of MEMICS,
LNCS.
Springer,
doi:10.1007/978-3-642-25929-6_3.
K. Chatterjee, L. Doyen, T.A. Henzinger & J.-F. Raskin (2010):
Generalized Mean-payoff and Energy Games.
In: Proc. of FSTTCS,
LIPIcs 8.
Schloss Dagstuhl - LZI,
pp. 505–516,
doi:10.4230/LIPIcs.FSTTCS.2010.505.
K. Chatterjee, L. Doyen, M. Randour & J.-F. Raskin (2013):
Looking at Mean-Payoff and Total-Payoff through Windows.
In: Proc. of ATVA,
LNCS 8172.
Springer,
pp. 118–132,
doi:10.1007/978-3-319-02444-8_10.
K. Chatterjee, M. Randour & J.-F. Raskin (2012):
Strategy Synthesis for Multi-Dimensional Quantitative Objectives.
In: Proc. of CONCUR,
LNCS 7454.
Springer,
pp. 115–131,
doi:10.1007/978-3-642-32940-1_10.
C. Courcoubetis & M. Yannakakis (1995):
The Complexity of Probabilistic Verification.
J. ACM 42(4),
pp. 857–907,
doi:10.1145/210332.210339.
A. Degorre, L. Doyen, R. Gentilini, J.-F. Raskin & S. Torunczyk (2010):
Energy and Mean-Payoff Games with Imperfect Information.
In: Proc. of CSL,
LNCS 6247.
Springer,
pp. 260–274,
doi:10.1007/978-3-642-15205-4_22.
A. Ehrenfeucht & J. Mycielski (1979):
Positional Strategies for Mean Payoff Games.
Int. Journal of Game Theory 8(2),
pp. 109–113,
doi:10.1007/BF01768705.
J. Filar & K. Vrieze (1997):
Competitive Markov decision processes.
Springer,
doi:10.1007/978-1-4612-4054-9.
J.A. Filar, D. Krass & K.W. Ross (1995):
Percentile Performance Criteria For Limiting Average Markov Decision Processes.
Transactions on Automatic Control,
pp. 2–10,
doi:10.1109/9.362904.
M.R. Garey & D.S. Johnson (1979):
Computers and intractability: a guide to the Theory of NP-Completeness.
Freeman New York.
T. Gawlitza & H. Seidl (2009):
Games through Nested Fixpoints.
In: Proc. of CAV,
LNCS 5643.
Springer,
pp. 291–305,
doi:10.1007/978-3-642-02658-4_24.
P.W. Glynn & D. Ormoneit (2002):
Hoeffding's inequality for uniformly ergodic Markov chains.
Statistics & Probability Letters 56(2),
pp. 143–146,
doi:10.1016/S0167-7152(01)00158-4.
P. Hunter, G. A. Pérez & J.-F. Raskin (2013):
Mean-payoff Games with Incomplete Information.
CoRR abs/1309.5462.
Available at http://arxiv.org/abs/1309.5462.
M. Jurdziński (1998):
Deciding the Winner in Parity Games is in UP co-UP.
Inf. Process. Lett. 68(3),
pp. 119–124,
doi:10.1016/S0020-0190(98)00150-1.
T.M. Liggett & S.A. Lippman (1969):
Stochastic games with perfect information and time average payoff.
Siam Review 11(4),
pp. 604–607,
doi:10.1137/1011093.
S. Mannor & J.N. Tsitsiklis (2011):
Mean-Variance Optimization in Markov Decision Processes.
In: Proc. of ICML.
Omnipress,
pp. 177–184.
M.L. Puterman (1994):
Markov decision processes: discrete stochastic dynamic programming,
1st edition.
John Wiley & Sons, Inc.,
New York, NY, USA,
doi:10.1002/9780470316887.
M. Tracol (2009):
Fast convergence to state-action frequency polytopes for MDPs.
Oper. Res. Lett. 37(2),
pp. 123–126,
doi:10.1016/j.orl.2008.12.003.
M.Y. Vardi (1985):
Automatic Verification of Probabilistic Concurrent Finite-State Programs.
In: Proc. of FOCS.
IEEE Computer Society,
pp. 327–338,
doi:10.1109/SFCS.1985.12.
C. Wu & Y. Lin (1999):
Minimizing Risk Models in Markov Decision Processes with Policies Depending on Target Values.
Journal of Mathematical Analysis and Applications 231(1),
pp. 47–67,
doi:10.1006/jmaa.1998.6203.
U. Zwick & M. Paterson (1996):
The complexity of mean payoff games on graphs.
Theoretical Computer Science 158,
pp. 343–359,
doi:10.1016/0304-3975(95)00188-3.
eptcs@eptcs.org