Polynomial-time computation of strong and n-present-value optimal policies in Markov decision chains
Year of publication: |
August 2017
|
---|---|
Authors: | O'Sullivan, Michael ; Veinott, Arthur F. <Jr.> |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 42.2017, 3, p. 577-598
|
Subject: | dynamic programming | computational complexity | infinite horizon | Theorie | Theory | Dynamische Optimierung | Dynamic programming | Mathematische Optimierung | Mathematical programming | Markov-Kette | Markov chain |
-
Finite-memory strategies in POMDPs with long-run average objectives
Chatterjee, Krishnendu, (2022)
-
Analytical solution to a partially observable machine maintenance problem with obvious failures
Zhang, Hao, (2023)
-
Robust modified policy iteration
Kaufman, David L., (2013)
- More ...
-
Mathematical studies in management science
Veinott, Arthur F. <Jr.>, (1965)
-
Sequential stochastic core of a cooperative stochastic programming game
Xu, Ningxiong, (2013)
-
Taut-string solution of the equilibrium no-lag Clark-Scarf serial inventory problem
Veinott, Arthur F. <Jr.>, (2013)
- More ...