Complexity bounds for approximately solving discounted MDPs by value iterations
Year of publication: |
2020
|
---|---|
Authors: | Feinberg, Eugene A. ; He, Gaojin |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 5, p. 543-548
|
Subject: | Algorithm | Complexity | Discounting | Markov decision process | Optimal policy | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Entscheidung | Decision | Markov-Kette | Markov chain | Diskontierung | Dynamische Optimierung | Dynamic programming |
-
A unified algorithm framework for mean-variance optimization in discounted Markov decision processes
Ma, Shuai, (2023)
-
Efficient algorithms of pathwise dynamic programming for decision optimization in mining operations
Hinz, Juri, (2020)
-
A numerical study of Markov decision process algorithms for multi-component replacement problems
Andersen, Jesper Fink, (2022)
- More ...
-
Quickest detection of drift change for Brownian motion in generalized Bayesian and minimax settings
Feinberg, Eugene A., (2006)
-
Handbook of Markov decision processes : methods and applications
Feinberg, Eugene A., (2002)
-
Feinberg, Eugene A., (2005)
- More ...