arXiv (All)
open access
Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain
Learning and optimal control under robust Markov decision processes (MDPs) have received increasing attention, yet most existing theory, algorithms, and applications focus on finite-horizon or discounted models. Long-run average-reward formulations, while natural in many operations research and mana
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
- Vector Bellman Theory for Multichain Robust Average-Reward Markov Decision Processes#1076448
- Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes#1161031
- Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes#1157479
- Bellman Error Minimization Via Linear Programming Normalization#1187044
- Dynamic Programming-Compatible Uncertainty Sets in Robust Markov Decision Processes#1050733
Record · ID 1402963
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