Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
Author
Abstract
Suggested Citation
DOI: 10.1287/moor.2018.0970
Download full text from publisher
References listed on IDEAS
- Uriel G. Rothblum & Peter Whittle, 1982. "Growth Optimality for Branching Markov Decision Chains," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 582-601, November.
- Stanley R. Pliska, 1976. "Optimization of Multitype Branching Processes," Management Science, INFORMS, vol. 23(2), pages 117-124, October.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Eugene A. Feinberg & Jefferson Huang, 2019. "On the reduction of total‐cost and average‐cost MDPs to discounted MDPs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 38-56, February.
- Yiqiang Q. Zhao & W. John Braun & Wei Li, 1999. "Northwest corner and banded matrix approximations to a Markov chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(2), pages 187-197, March.
- Daniel Hernández Hernández & Diego Hernández Bustos, 2017. "Local Poisson Equations Associated with Discrete-Time Markov Control Processes," Journal of Optimization Theory and Applications, Springer, vol. 173(1), pages 1-29, April.
- Arie Leizarowitz, 2003. "An Algorithm to Identify and Compute Average Optimal Policies in Multichain Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 553-586, August.
More about this item
Keywords
multitype branching processes; Markov decision processes; Bellman optimality equations; generalized Newton method; olynomial time algorithms;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:45:y:2020:i:1:p:34-62. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.