Markov decision processes with burstiness constraints

DOI10.1016/j.ejor.2023.07.045OpenAlexW4385554752MaRDI QIDQ6087483

Michal Golan, Nahum Shimkin

Publication date: 15 November 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2023.07.045

zbMATH Keywords

dynamic programmingconstrained Markov decision processesburstiness constraints

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random search for constrained Markov decision processes with multi-policy improvement
• Constrained Markov decision processes with uncertain costs
• Finite Linear Programming Approximations of Constrained Discounted Markov Decision Processes
• Risk-Constrained Markov Decision Processes
• A calculus for network delay. I. Network elements in isolation
• Optimal control of admission to a quenching system
• Markov Decision Processes with Sample Path Constraints: The Communicating Case
• On Linear Programming for Constrained and Unconstrained Average-Cost Markov Decision Processes with Countable Action Spaces and Strictly Unbounded Costs
• Constrained Markov Decision Processes with Expected Total Reward Criteria
• The Regulation of Queue Size by Levying Tolls
• Network calculus. A theory of deterministic queueing systems for the Internet
• Handbook of Markov decision processes. Methods and applications

This page was built for publication: Markov decision processes with burstiness constraints