MDPs with setwise continuous transition probabilities
From MaRDI portal
Publication:2060367
Recommendations
- Average cost Markov decision processes with weakly continuous transition probabilities
- On a set of optimal policies in continuous time Markovian decision problem
- On some continuous time discounted Markov decision process.
- Continuous-Time Markov Decision Processes with Discounted Rewards: The Case of Polish Spaces
- scientific article; zbMATH DE number 700091
Cites work
- scientific article; zbMATH DE number 3860907 (Why is no real title available?)
- scientific article; zbMATH DE number 4074840 (Why is no real title available?)
- scientific article; zbMATH DE number 3664132 (Why is no real title available?)
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- scientific article; zbMATH DE number 3301983 (Why is no real title available?)
- Average Optimality in Dynamic Programming with General State Space
- Average cost Markov decision processes with weakly continuous transition probabilities
- Average optimality in dynamic programming on Borel spaces -- unbounded costs and controls
- Berge's theorem for noncompact image sets
- Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
- Examples concerning Abel and Cesàro limits
- Fatou's lemma in its classical form and Lebesgue's convergence theorems for varying measures with applications to Markov decision processes
- Measurable Selection and Dynamic Programming
- Measurable selection theorems for optimization problems
- Measurable selections of extrema
- Negative Dynamic Programming
- On Stationary Strategies in Borel Dynamic Programming
- On convergence of value iteration for a class of total cost Markov decision processes
- Optimal Plans for Dynamic Programming Problems
- Optimality Inequalities for Average Cost Markov Decision Processes and the Stochastic Cash Balance Problem
- Partially observable total-cost Markov decision processes with weakly continuous transition probabilities
- Stationary policies and Markov policies in Borel dynamic programming
- Sufficiency of deterministic policies for atomless discounted and uniformly absorbing MDPs with multiple criteria
- Sufficient Classes of Strategies in Discrete Dynamic Programming I: Decomposition of Randomized Strategies and Embedded Models
Cited in
(4)
This page was built for publication: MDPs with setwise continuous transition probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2060367)