Maximum-stopping-value policies in finite markov population decision chains
Year of publication: |
2014
|
---|---|
Authors: | Eaves, Burchett Curtis ; Veinott, Arthur F. <Jr.> |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 39.2014, 3, p. 597-606
|
Subject: | Markov population decision chains | infinite horizon | finite state and action | stationary optimal stopping policies | optimal return operator | least fixed points | policy improvement | successive approximation | linear programming | Theorie | Theory | Markov-Kette | Markov chain | Mathematische Optimierung | Mathematical programming |
-
Polynomial-time computation of strong and n-present-value optimal policies in Markov decision chains
O'Sullivan, Michael, (2017)
-
Gast, Nicolas, (2024)
-
The simplex method is strongly polynomial for deterministic Markov decision processes
Post, Ian, (2015)
- More ...
-
A course in triangulations for solving equations with deformations
Eaves, Burchett Curtis, (1984)
-
Mathematical studies in management science
Veinott, Arthur F. <Jr.>, (1965)
-
Sequential stochastic core of a cooperative stochastic programming game
Xu, Ningxiong, (2013)
- More ...