arXiv (All)
open access
Dynamic Programming-Compatible Uncertainty Sets in Robust Markov Decision Processes
In this paper, we investigate the compatibility of robust Markov Decision Processes (RMDPs) with dynamic programming under various assumptions on the uncertainty set, i.e., we investigate when one can solve an RMDP by solving a fixed point equation. We show that in all generality, s-rectangular and
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Essays on Dynamic Decision Making under Uncertainty#405475
- Value iteration with guessing for Markov chains and Markov decision processes#1039243
- Introduction to Mathematical Programming#3612
- Adaptive mine planning under geological uncertainty: A POMDP framework for sequential decision-making#180695
- Adaptive Resolving Methods for Markov Decision Processes with Function Approximations#925779
Record · ID 1050733
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive