Solving Markov decision processes via state space decomposition and time aggregation
Year of publication: |
2025
|
---|---|
Authors: | Alexandre, Rodrigo e Alvim ; Fragoso, Marcelo D. ; Ferreira Filho, Virgílio J. M. ; Arruda, Edilson Fernandes de |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 324.2025, 1 (1.7.), p. 155-167
|
Subject: | Dynamic programming | Foster’s stochastic stability conditions | Markov decision processes | Markov processes | Time aggregation | Markov-Kette | Markov chain | Theorie | Theory | Dynamische Optimierung | Entscheidung | Decision | Mathematische Optimierung | Mathematical programming | Aggregation | Stochastischer Prozess | Stochastic process |
-
Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm
Arruda, E. F., (2015)
-
On boundedness of Q-learning iterates for stochastic shortest path problems
Yu, Huizhen, (2013)
-
Envelope theorems for multistage linear stochastic optimization
Terça, Gonçalo, (2021)
- More ...
-
Time aggregated Markov decision processes via standard dynamic programming
Arruda, Edilson Fernandes de, (2011)
-
Factors influencing the delivery of cancer pathways : a summary of the literature
Brice, Syaribah Noor, (2021)
-
Accelerating the convergence of value iteration by using partial transition functions
Arruda, Edilson Fernandes de, (2013)
- More ...