Distributionally Robust Markov Decision Processes

Published Online:https://doi.org/10.1287/moor.1120.0540

References

  • Abbad M, Filar J. Perturbation and stability theory for Markov control problems. IEEE Trans. Automatic Control (1992) 37(9):1415–1420CrossrefGoogle Scholar
  • Abbad M, Filar JA, Bielecki TR. Algorithms for singularly perturbed limiting average Markov control problems. IEEE Trans. Automatic Control (1992) 37(9):1421–1425CrossrefGoogle Scholar
  • Avrachenkov KE, Filar J, Haviv M, Feinberg EA, Shwartz A. Singular perturbations of Markov chains and decision processes. Handbook of Markov Decision Processes: Methods and Applications (2002) CrossrefGoogle Scholar
  • Bagnell A, Ng A, Schneider J. Solving uncertain Markov decision problems. (2001) . Technical Report CMU-RI-TR-01-25, Carnegie Mellon University, PittsburghGoogle Scholar
  • Baron J. Thinking and Deciding (2000) (Cambridge University Press, New York) Google Scholar
  • Ben-Tal A, Nemirovski A. Robust solutions of uncertain linear programs. Oper. Res. Lett. (1999) 25(1):1–13CrossrefGoogle Scholar
  • Bertsekas DP, Tsitsiklis JN. Neuro-Dynamic Programming (1996) (Athena Scientific, Nashua, NH) Google Scholar
  • Blackwell D, Girshick M. Theory of Games and Statistical Decisions (1954) (John Wiley & Sons Inc., New York) Google Scholar
  • Boyd S, Vandenberghe L. Convex Optimization (2004) (Cambridge University Press, New York) CrossrefGoogle Scholar
  • Calafiore G, El Ghaoui L. On distributionally robust chance-constrained linear programs. J. Optimization Theory and Appl. (2006) 130(1):1–22CrossrefGoogle Scholar
  • Delage E, Mannor S. Percentile optimization for Markov decision processes with parameter uncertainty. Oper. Res. (2010) 58(1):203–213LinkGoogle Scholar
  • Delage E, Ye Y. Distributionally robust optimization under moment uncertainty with applications to data-driven problems. Oper. Res. (2010) 58(3):596–612LinkGoogle Scholar
  • Delebecque F, Quadrat JP. Optimal control of Markov chains admitting strong and weak interactions. Automatica (1981) 17(2):281–296CrossrefGoogle Scholar
  • Dupacová J. The minimax approach to stochastic programming and an illustrative application. Stochastics (1987) 20:73–88CrossrefGoogle Scholar
  • Dvoretzky A, Wald A, Wolfowitz J. Elimination of randomization in certain statistical decision procedures and zero-sum two-person games. Ann. Math. Statist. (1951) 22(1):1–21CrossrefGoogle Scholar
  • Epstein LG, Schneider M. Learning under ambiguity. Rev. Econom. Stud. (2007) 74(4):1275–1303CrossrefGoogle Scholar
  • Gilboa I, Schmeidler D. Maxmin expected utility with a non-unique prior. J. Math. Econom. (1989) 18(2):141–153CrossrefGoogle Scholar
  • Goh J, Sim M. Distributionally robust optimization and its tractable approximations. Oper. Res. (2010) 58(4):902–917LinkGoogle Scholar
  • Grötschel M, Lovász L, Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988) (Springer, Heidelberg) CrossrefGoogle Scholar
  • Iyengar GN. Robust dynamic programming. Math. Oper. Res. (2005) 30(2):257–280LinkGoogle Scholar
  • Kall P. Stochastic programming with recourse: Upper bounds and moment problems, a review. Advances in Mathematical Optimization (1988) (Academie-Verlag, Berlin) 86–103Google Scholar
  • Karlin S. The theory of infinite games. Ann. Math. (1953) 58(2):371–401CrossrefGoogle Scholar
  • Kelsey D. Maxmin expected utility and weight of evidence. Oxford Econom. Papers (1994) 46(3):425–444Google Scholar
  • Mannor S, Simester D, Sun P, Tsitsiklis JN. Bias and variance approximation in value function estimates. Management Sci. (2007) 53(2):308–322LinkGoogle Scholar
  • Nilim A, El Ghaoui L. Robust control of Markov decision processes with uncertain transition matrices. Oper. Res. (2005) 53(5):780–798LinkGoogle Scholar
  • Popescu I. Robust mean-covariance solutions for stochastic optimization. Oper. Res. (2007) 55(1):98–112LinkGoogle Scholar
  • Puterman ML. Markov Decision Processes (1994) (John Wiley & Sons, New York) CrossrefGoogle Scholar
  • Rockafellar RT. Convex Analysis (1970) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Scarf H, Arrow KJ, Karlin S, Scarf H. A min-max solution of an inventory problem. Studies in Mathematical Theory of Inventory and Production (1958) (Stanford University Press, Stanford, CA) 201–209Google Scholar
  • Shapiro A. Worst-case distribution analysis of stochastic programs. Math. Programming (2006) 107(1):91–96CrossrefGoogle Scholar
  • Shapley LS. Stochastic games. Proc. National Acad. Sci. USA (1953) 39(10):1095–1100CrossrefGoogle Scholar
  • Sion M. On general minimax theorems. Pacific J. Math. (1958) 8(1):171–176CrossrefGoogle Scholar
  • White CC, El Deib HK. Markov decision processes with imprecise transition probabilities. Oper. Res. (1992) 42(4):739–748LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.