Recent results on conditions for the existence of average optimal stationary policies
From MaRDI portal
Publication:1174694
DOI10.1007/BF02055572zbMath0744.90097OpenAlexW1970113863MaRDI QIDQ1174694
Publication date: 25 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02055572
Doeblin conditionaverage rewardcountable state Markov decision processesexistence of optimal stationary policies
Markov and semi-Markov decision processes (90C40) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (6)
Optimization problems in chemical reactions using continuous-time Markov chains ⋮ Zero-sum Markov games and worst-case optimal control of queueing systems ⋮ A note on the existence of optimal stationary policies for average Markov decision processes with countable states ⋮ Solutions of the average cost optimality equation for Markov decision processes with weakly continuous kernel: the fixed-point approach revisited ⋮ Denumerable controlled Markov chains with average reward criterion: Sample path optimality ⋮ A survey of Markov decision models for control of networks of queues
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new condition for the existence of optimal stationary policies in average cost Markov decision processes
- Necessary and sufficient conditions for a bounded solution to the optimality equation in average reward Markov decision chains
- Necessary conditions for the optimality equation in average-reward Markov decision processes
- Comparing recent assumptions for the existence of average optimal stationary policies
- Optimal priority assignment with hard constraint
- Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
- Average Cost Semi-Markov Decision Processes and the Control of Queueing Systems
- Denumerable Undiscounted Semi-Markov Decision Processes with Unbounded Rewards
- On Minimum Cost Per Unit Time Control of Markov Chains
- Control of Markov Chains with Long-Run Average Cost Criterion: The Dynamic Programming Equations
- Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs
- A note on simultaneous recurrence conditions on a set of denumerable stochastic matrices
- Optimal control of service rates in networks of queues
This page was built for publication: Recent results on conditions for the existence of average optimal stationary policies