arXiv CS
open access
Reward Objectives for Robust (PO)MDPs: A Law-Preserving Equivalence with (Partially Observable) Games
Robust partially observable Markov decision processes model agents that act under partial observability while adversarial environment resolves uncertainty in the transition probabilities. Reward objectives such as discounted-sum, long-run average and cumulative reward under finite and infinite horiz
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
- Dynamic Programming for Value-at-risk Markov Decision Processes in Continuous Spaces#1389005
- SafeDiSTL: Decomposing Joint Constraints for Safe Multi-Agent Reinforcement Learning#1298233
- SafeDiSTL: Decomposing Joint Constraints for Safe Multi-Agent Reinforcement Learning#1291820
- Achieving an $O(1/N)$ Optimality Gap in Average-Reward Weakly-Coupled MDPs#1142427
- Achieving an $O(1/N)$ Optimality Gap in Average-Reward Weakly-Coupled MDPs#1122282
Record · ID 1381289
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