Finite-Memory Strategies in POMDPs with Long-Run Average Objectives
From MaRDI portal
Publication:5076693
DOI10.1287/moor.2020.1116zbMath1492.90189arXiv1904.13360OpenAlexW3151962715MaRDI QIDQ5076693
Raimundo Saona, Krishnendu Chatterjee, Bruno Ziliotto
Publication date: 17 May 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.13360
Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Repeated games with public uncertain duration process
- Uniform value in dynamic programming
- On the undecidability of probabilistic planning and related stochastic optimization problems
- Computing uniformly optimal strategies in two-player stochastic games
- Probabilistic automata
- Continuity of the value of competitive Markov decision processes
- Markov chains and invariant probabilities
- Blackwell optimality in Markov decision processes with partial observation.
- Concurrent games with tail objectives
- Strong Uniform Value in Gambling Houses and Partially Observable Markov Decision Processes
- Biological Sequence Analysis
- Average Cost Dynamic Programming Equations For Controlled Markov Chains With Partial Observations
- Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
- Discrete Dynamic Programming
- Probabilistic ω-automata
- Probabilistic automata
- Long-Term Values in Markov Decision Processes and Repeated Games, and a New Distance for Probability Spaces
- Stochastic Games
This page was built for publication: Finite-Memory Strategies in POMDPs with Long-Run Average Objectives
