An approximation procedure for stochastic dynamic programming in countable state space
From MaRDI portal
Cited in
(4)- Finite state approximation algorithms for average cost denumerable state Markov decision processes
- Clustering Based Approximation Procedure for Semi-Markov Decision Processes with Incomplete State Information
- Zur konstruktfon ∊-optimaler polltiken in markovschen entscheidungsmodellen mit überabzämbarem zustandsraum
- Approximations and bounds for a generalized optimal stopping problem
This page was built for publication: An approximation procedure for stochastic dynamic programming in countable state space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168796)