ISTA Publications
metadata only
Finite-memory strategies in POMDPs with long-run average objectives
Partially observable Markov decision processes (POMDPs) are standard models for dynamic systems with probabilistic and nondeterministic behaviour in uncertain environments. We prove that in POMDPs with long-run average objective, the decision maker has approximately optimal strategies with finite me
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
- Beyond Expected Information Gain: Stable Bayesian Optimal Experimental Design with Integral Probability Metrics and Plug-and-Play Extensions#126504
- Maximising Expected Value Under Axiological Uncertainty. An Axiomatic Approach#763227
- Monotone Inclusion Approach to Weakly Monotone Discrete-Time Finite-Horizon Mean-Field Games#612506
- Monotone Inclusion Approach to Weakly Monotone Discrete-Time Finite-Horizon Mean-Field Games#611029
- Optimizing Minimax Regret in Uncertain MDPs with Small Sets of Policies#423965
Record · ID 1066575
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