Baier, C., Daum, M., Dubslaff, C., Klein, J., Klüppelholz, S.: Energy-utility quantiles. In: Badger, J. M., Rozier, K. Y. (eds.) NFM 2014. LNCS, vol. 8430, pp. 285-299. Springer, Heidelberg (2014).
Bertsekas, D. P., Tsitsiklis, J. N.: An analysis of stochastic shortest path problems. Math. Oper. Res. 16, 580-595 (1991).
Boker, U., Henzinger, T. A.: Exact and approximate determinization of discountedsum automata. LMCS 10(1), 1-33 (2014).
Boker, U., Henzinger, T. A., Otop, J.: The target discounted-sum problem. In: Proceedings of LICS. IEEE Computer Society (2015).
Brázdil, T., Chen, T., Forejt, V., Novotný, P., Simaitis, A.: Solvency Markov decision processes with interest. In: Proceedings of FSTTCS, LIPIcs, vol. 24, pp. 487-499. Schloss Dagstuhl-LZI (2013).
Brázdil, T., Brozek, V., Chatterjee, K., Forejt, V., Kucera, A.: Markov decision processes with multiple long-run average objectives. LMCS 10(13), 1-29 (2014).
Bruyère, V., Filiot, E., Randour, M., Raskin, J.-F.: Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games. In: Proceedings of STACS, LIPIcs, vol. 25, pp. 199-213. Schloss Dagstuhl-LZI (2014).
Chatterjee, K., Doyen, L., Randour, M., Raskin, J.-F.: Looking at mean-payoff and total-payoff through windows. In: Van Hung, D., Ogawa, M. (eds.) ATVA 2013. LNCS, vol. 8172, pp. 118-132. Springer, Heidelberg (2013).
Chatterjee, K., Forejt, V., Wojtczak, D.: Multi-objective discounted reward verification in graphs and MDPs. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR-19 2013. LNCS, vol. 8312, pp. 228-242. Springer, Heidelberg (2013).
Chatterjee, K., Henzinger, T. A.: Probabilistic systems with limsup and liminf objectives. In: Archibald, M., Brattka, V., Goranko, V., Löwe, B. (eds.) ILC 2007. LNCS, vol. 5489, pp. 32-45. Springer, Heidelberg (2009).
Chatterjee, K., Komárková, Z., Kretínský, J.: Unifying two views on multiple meanpayoff objectives in Markov decision processes. In: Proceedings of LICS. IEEE Computer Society (2015).
Chatterjee, K., Majumdar, R., Henzinger, T. A.: Markov decision processes with multiple objectives. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 325-336. Springer, Heidelberg (2006).
Chatterjee, K., Randour, M., Raskin, J.-F.: Strategy synthesis for multidimensional quantitative objectives. Acta Inform. 51(3-4), 129-163 (2014).
de Alfaro, L.: Formal verification of probabilistic systems. Ph. D. thesis, Stanford University (1997).
de Alfaro, L.: Computing minimum and maximum reachability times in probabilistic systems. In: Baeten, J. C. M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 66-81. Springer, Heidelberg (1999).
Etessami, K., Kwiatkowska, M. Z., Vardi, M. Y., Yannakakis, M.: Multi-objective model checking of Markov decision processes. LMCS 4(4), 1-21 (2008).
Filar, J. A., Krass, D., Ross, K. W.: Percentile performance criteria for limiting average Markov decision processes. IEEE Trans. Aut. Control 40(1), 2-10 (1995).
Garey, Michael R., Johnson, David S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979).
Goldreich, O.: On promise problems: a survey. In: Goldreich, O., Rosenberg, A. L., Selman, A. L. (eds.) Theoretical Computer Science. LNCS, vol. 3895, pp. 254-290. Springer, Heidelberg (2006).
Haase, C., Kiefer, S.: The complexity of the Kth largest subset problem and related problems. CoRR, abs/1501. 06729 (2015).
Haase, C., Kiefer, S.: The odds of staying on budget. In: Halldórsson, M. M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 234-246. Springer, Heidelberg (2015).
Ohtsubo, Y.: Optimal threshold probability in undiscounted Markov decision processes with a target set. Appl. Math. Comput. 149(2), 519-532 (2004).
Puterman, M. L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1st edn. Wiley, New York (1994).
Randour, M., Raskin, J.-F., Sankur, O.: Percentile queries in multi-dimensional Markov decision processes. CoRR, abs/1410. 4801 (2014).
Randour, M., Raskin, J.-F., Sankur, O.: Variations on the stochastic shortest path problem. In: D'Souza, D., Lal, A., Larsen, K. G. (eds.) VMCAI 2015. LNCS, vol. 8931, pp. 1-18. Springer, Heidelberg (2015).
Sakaguchi, M., Ohtsubo, Y.: Markov decision processes associated with two threshold probability criteria. J. Control Theor. Appl. 11(4), 548-557 (2013).
Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20(5), 865-877 (1991).
Travers, S. D.: The complexity of membership problems for circuits over sets of integers. Theor. Comput. Sci. 369(1-3), 211-229 (2006).
Ummels, M., Baier, C.: Computing quantiles in Markov reward models. In: Pfenning, F. (ed.) FOSSACS 2013 (ETAPS 2013). LNCS, vol. 7794, pp. 353-368. Springer, Heidelberg (2013).
White, D. J.: Minimizing a threshold probability in discounted Markov decision processes. J. Math. Anal. Appl. 173(2), 634-646 (1993).
Wu, C., Lin, Y.: Minimizing risk models in Markov decision processes with policies depending on target values. J. Math. Anal. Appl. 231(1), 47-67 (1999).
