Markov decision processes with burstiness constraints
Author
Abstract
Suggested Citation
DOI: 10.1016/j.ejor.2023.07.045
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
- Keith W. Ross & Ravi Varadarajan, 1989. "Markov Decision Processes with Sample Path Constraints: The Communicating Case," Operations Research, INFORMS, vol. 37(5), pages 780-790, October.
- Richard Bellman, 1957. "On a Dynamic Programming Approach to the Caterer Problem--I," Management Science, INFORMS, vol. 3(3), pages 270-278, April.
- Albert-László Barabási, 2005. "The origin of bursts and heavy tails in human dynamics," Nature, Nature, vol. 435(7039), pages 207-211, May.
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.- Legros, Benjamin & Fransoo, Jan C., 2024. "Admission and pricing optimization of on-street parking with delivery bays," European Journal of Operational Research, Elsevier, vol. 312(1), pages 138-149.
- De Munck, Thomas & Chevalier, Philippe & Tancrez, Jean-Sébastien, 2023. "Managing priorities on on-demand service platforms with waiting time differentiation," International Journal of Production Economics, Elsevier, vol. 266(C).
- Sheng Zhu & Jinting Wang & Bin Liu, 2020. "Equilibrium joining strategies in the Mn/G/1 queue with server breakdowns and repairs," Operational Research, Springer, vol. 20(4), pages 2163-2187, December.
- Eric Sucky, 2006. "Kontraktlogistik—Ein stochastisch dynamischer Planungsansatz zur Logistikdienstleisterauswahl," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 17(2), pages 131-153, June.
- L D Smith & D C Sweeney & J F Campbell, 2009. "Simulation of alternative approaches to relieving congestion at locks in a river transportion system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(4), pages 519-533, April.
- Refael Hassin, 2022. "Profit maximization and cost balancing in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 429-431, April.
- Pierre Bernhard & Marc Deschamps, 2017. "Kalman on dynamics and contro, Linear System Theory, Optimal Control, and Filter," Working Papers 2017-10, CRESE.
- Jones, Randall E. & Cacho, Oscar J., 2000.
"A Dynamic Optimisation Model of Weed Control,"
2000 Conference (44th), January 23-25, 2000, Sydney, Australia
123685, Australian Agricultural and Resource Economics Society.
- Cacho, Oscar J. & Jones, Randall E., 2000. "A Dynamic Optimisation Model of Weed Control," Working Papers 12902, University of New England, School of Economics.
- Balachandran, Kashi R. & Radhakrishnan, Suresh, 1996. "Cost of congestion, operational efficiency and management accounting," European Journal of Operational Research, Elsevier, vol. 89(2), pages 237-245, March.
- Voelkel, Michael A. & Sachs, Anna-Lena & Thonemann, Ulrich W., 2020. "An aggregation-based approximate dynamic programming approach for the periodic review model with random yield," European Journal of Operational Research, Elsevier, vol. 281(2), pages 286-298.
- Belzil, Christian, 2007.
"The return to schooling in structural dynamic models: a survey,"
European Economic Review, Elsevier, vol. 51(5), pages 1059-1105, July.
- Belzil, Christian, 2006. "The Return to Schooling in Structural Dynamic Models: A Survey," IZA Discussion Papers 2370, Institute of Labor Economics (IZA).
- Christian Belzil, 2006. "The Return to Schooling in Structural Dynamic Models: A Survey," Working Papers 0609, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
- Christian Belzil, 2006. "The Return to Schooling in Structural Dynamic Models: A Survey," Post-Print halshs-00142538, HAL.
- Christian Belzil, 2007. "The Return to Schooling in Structural Dynamic Models: A Survey," Post-Print halshs-00201230, HAL.
- Pam Norton & Ravi Phatarfod, 2008. "Optimal Strategies In One-Day Cricket," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 25(04), pages 495-511.
- Mitri Kitti, 2013. "Subgame Perfect Equilibria in Discounted Stochastic Games," Discussion Papers 87, Aboa Centre for Economics.
- Rempel, M. & Cai, J., 2021. "A review of approximate dynamic programming applications within military operations research," Operations Research Perspectives, Elsevier, vol. 8(C).
- Kyle Y. Lin, 2003. "Decentralized admission control of a queueing system: A game‐theoretic model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 702-718, October.
- Elena M. Parilina & Alessandro Tampieri, 2018.
"Stability and cooperative solution in stochastic games,"
Theory and Decision, Springer, vol. 84(4), pages 601-625, June.
- Alessandro Tampieri & Elena M. Parilina, 2014. "Stability and Cooperative Solution in Stochastic Games," DEM Discussion Paper Series 14-26, Department of Economics at the University of Luxembourg.
- Ying Shi & Xin Li & Ping Fan, 2016. "Optimization of an M/M/∞ Queueing System with Free Experience Service," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(06), pages 1-17, December.
- Yong, Nuo & Ni, Shunjiang & Shen, Shifei & Ji, Xuewei, 2016. "An understanding of human dynamics in urban subway traffic from the Maximum Entropy Principle," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 456(C), pages 222-227.
- Kyle Y. Lin & Sheldon M. Ross, 2003. "Admission Control with Incomplete Information of a Queueing System," Operations Research, INFORMS, vol. 51(4), pages 645-654, August.
- Aghayi, Nazila & Maleki, Bentolhoda, 2016. "Efficiency measurement of DMUs with undesirable outputs under uncertainty based on the directional distance function: Application on bank industry," Energy, Elsevier, vol. 112(C), pages 376-387.
More about this item
Keywords
Dynamic programming; Constrained Markov decision processes; Burstiness constraints;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:eee:ejores:v:312:y:2024:i:3:p:877-889. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.