Estimates for finite-stage dynamic programs
From MaRDI portal
Cites work
- A modified dynamic programming method for Markovian decision problems
- Discounted Dynamic Programming
- scientific article; zbMATH DE number 3648458 (Why is no real title available?)
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 3956823 (Why is no real title available?)
- scientific article; zbMATH DE number 3529640 (Why is no real title available?)
- scientific article; zbMATH DE number 3263788 (Why is no real title available?)
- scientific article; zbMATH DE number 3320878 (Why is no real title available?)
- Negative Dynamic Programming
- Some Bounds for Discounted Sequential Decision Processes
- The optimal reward operator in dynamic programming
- Turnpike Planning Horizons for a Markovian Decision Model
- Zur Extrapolation in Markoffschen Entscheidungsmodellen mit Diskontierung
Cited in
(7)- On optimality criteria for dynamic programs with long finite horizons
- A natural extension of the MacQueen extrapolation
- Computing efficient steady state policies for deterministic dynamic programs. I
- Markov programming by successive approximations with respect to weighted supremum norms
- Bounds for the approximation of dynamic programs
- Some basic concepts of numerical treatment of Markov decision models
- Improved iterative computation of the expected discounted return in Markov and semi-Markov chains
This page was built for publication: Estimates for finite-stage dynamic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1228974)
