Bounding the Difference between the Values of Robust and Non-Robust Markov Decision Problems
Not on the map. Why?
Abstract (arXiv)
In this note we provide an upper bound for the difference between the value function of a distributionally robust Markov decision problem and the value function of a non-robust Markov decision problem, where the ambiguity set of probability kernels of the distributionally robust Markov decision process is described by a Wasserstein-ball around some reference kernel whereas the non-robust Markov decision process behaves according to a fixed probability kernel contained in the ambiguity set. Our derived upper bound for the difference between the value functions is dimension-free and depends linearly on the radius of the Wasserstein-ball.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 10 Aug 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.