scientific article; zbMATH DE number 1786118
From MaRDI portal
Publication:4547438
Recommendations
Cited in
(14)- On convergence of value iteration for a class of total cost Markov decision processes
- A convex programming approach for discrete-time Markov decision processes under the expected total reward criterion
- The transformation method for continuous-time Markov decision processes
- Complexity bounds for approximately solving discounted MDPs by value iterations
- scientific article; zbMATH DE number 1786119 (Why is no real title available?)
- Finite state dynamic programming with the total reward criterion
- On the reduction of total-cost and average-cost MDPs to discounted mdps
- Regular policies in abstract dynamic programming
- The expected total cost criterion for Markov decision processes under constraints: a convex analytic approach
- Realizable strategies in continuous-time Markov decision processes
- Full implementation of rank-dependent prizes
- Finitely additive dynamic programming
- Discounted dynamic programming with unbounded returns: application to economic models
- On variable discounting in dynamic programming: applications to resource extraction and other economic models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547438)
