The Computation of Average Optimal Policies in Denumerable State Markov Decision Chains
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3900546
- scientific article; zbMATH DE number 1424150
- Solution to the optimality equation in a class of Markov decision chains with the average cost criterion
- Finite state approximation algorithms for average cost denumerable state Markov decision processes
- Value Iteration in a Class of Communicating Markov Decision Chains with the Average Cost Criterion
Cited in
(10)- Finite state approximation algorithms for average cost denumerable state Markov decision processes
- On computing average cost optimal policies with application to routing to parallel queues
- Computing optimal policies for Markovian decision processes using simulation
- scientific article; zbMATH DE number 3928750 (Why is no real title available?)
- Recurrence Conditions for Average and Blackwell Optimality in Denumerable State Markov Decision Chains
- scientific article; zbMATH DE number 6932166 (Why is no real title available?)
- scientific article; zbMATH DE number 3265247 (Why is no real title available?)
- An Algorithm to Identify and Compute Average Optimal Policies in Multichain Markov Decision Processes
- Computation of a near-optimal service policy for a single-server queue with homogeneous jobs
- Stochastic dynamic job scheduling with interruptible setup and processing times: an approach based on queueing control
This page was built for publication: The Computation of Average Optimal Policies in Denumerable State Markov Decision Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339343)