arXiv (All)
open access
The Complexity of Approximating the Value in Revealing POMDPs with Long-Run Average Objectives
We study partially observable Markov decision processes (POMDPs) with long-run average objectives, where the payoff is defined as the limit inferior of the expected average rewards. We consider the computational problem of approximating the long-run average value of a POMDP. In general, the long-run
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
- How Much Should Governments Pay to Prevent Catastrophes? Longtermism's Limited Role#722834
- Same Problem, Different Field: Cross-Domain Solution Import via Domain-Stripped Computational Fingerprints#1123208
- Navigating confidence–precision trade-offs in assessment#705335
- Approximating evidence via bounded harmonic means#1116149
- Sequential Design of Genetic Circuits Under Uncertainty With Reinforcement Learning#168338
Record · ID 984247
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