An Iterative Aggregation Procedure for Markov Decision Processes
Author
Abstract
Suggested Citation
DOI: 10.1287/opre.30.1.62
Download full text from publisher
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Jie Ning & Matthew J. Sobel, 2019. "Easy Affine Markov Decision Processes," Operations Research, INFORMS, vol. 67(6), pages 1719-1737, November.
- Chevalier, Philippe & Lamas, Alejandro & Lu, Liang & Mlinar, Tanja, 2015.
"Revenue management for operations with urgent orders,"
European Journal of Operational Research, Elsevier, vol. 240(2), pages 476-487.
- LAMAS, Alejandro & MLINAR, Tanja & CHEVALIER, Philippe, 2013. "Revenue management for operations with urgent orders," LIDAM Discussion Papers CORE 2013046, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- CHEVALIER, Philippe & LAMAS, Alejandro & LU, Lian & MLINAR, Tanja, 2015. "Revenue management for operations with urgent orders," LIDAM Reprints CORE 2628, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Ali Fattahi & Sriram Dasu & Reza Ahmadi, 2023. "Peak-Load Energy Management by Direct Load Control Contracts," Management Science, INFORMS, vol. 69(5), pages 2788-2813, May.
- Michael Z. Spivey & Warren B. Powell, 2004. "The Dynamic Assignment Problem," Transportation Science, INFORMS, vol. 38(4), pages 399-419, November.
- Benjamin Van Roy, 2006. "Performance Loss Bounds for Approximate Value Iteration with State Aggregation," Mathematics of Operations Research, INFORMS, vol. 31(2), pages 234-244, May.
More about this item
Keywords
116 finite state Markov decision processes; 637 linear programming: algorithms;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:oropre:v:30:y:1982:i:1:p:62-73. 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.
We have no bibliographic references for this item. You can help adding them by using 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.