arXiv (All)
open access
Algebraic optimization of sequential decision problems
We study the optimization of the expected long-term reward in finite partially observable Markov decision processes over the set of stationary stochastic policies. In the case of deterministic observations, also known as state aggregation, the problem is equivalent to optimizing a linear objective s
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
- Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent#1052029
- Fairness under uncertainty in sequential decisions#126517
Record · ID 997892
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