arXiv (All)
open access
Dynamic Programming for Value-at-risk Markov Decision Processes in Continuous Spaces
Value-at-Risk (VaR) is a widely adopted quantile-based risk measure in practice, yet incorporating VaR objectives into Markov decision processes (VaR MDPs) remains a longstanding challenge. Recent work has derived dynamic programming equations for VaR MDPs in finite state and action spaces but left
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
- Risk-Aware General-Utility Markov Decision Processes#361468
- Continuous-Time Distributed Dynamic Programming for Networked Multi-Agent Markov Decision Processes#430509
- Learning Chance-Constrained MDPs with Bellman Distributional Certificates#1105415
- Reward Objectives for Robust (PO)MDPs: A Law-Preserving Equivalence with (Partially Observable) Games#1381289
- Risk-aware Markov decision processes using cumulative prospect theory#1066580
Record · ID 1389005
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