Polynomial-time computation of strong and n-present-value optimal policies in Markov decision chains
Michael O'Sullivan, Arthur F. Veinott Jr.
| 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 | Markov-Kette | Markov chain | Mathematische Optimierung | Mathematical programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/moor.2016.0812 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011742428