Approximation procedure for stochastic dynamic programming based on clustering of state and action spaces

DOI10.1080/02331937908842555zbMATH Open0408.62006OpenAlexW2086244885MaRDI QIDQ4195752FDOQ4195752

Authors: V. Nollau, A. Hahnewald-Busch 

Publication date: 1979

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331937908842555

zbMATH Keywords

Dynamic ProgrammingMarkov ProgrammingDecision TheoryClustering of State and Action SpacesConvergence of Approximative ProblemsState and Action Space Decomposition

Mathematics Subject Classification ID

Statistical decision theory (62C99) Hamilton-Jacobi theories (49L99) Markov and semi-Markov decision processes (90C40)

Cited In (3)

• Zur konstruktfon ∊-optimaler polltiken in markovschen entscheidungsmodellen mit überabzämbarem zustandsraum
• Approximations and bounds for a generalized optimal stopping problem
• Finite state approximation algorithms for average cost denumerable state Markov decision processes

This page was built for publication: Approximation procedure for stochastic dynamic programming based on clustering of state and action spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4195752)