On truncations and perturbations of Markov decision problems with an application to queueing network overflow control

DOI10.1007/BF02283612zbMath0717.90096OpenAlexW2078733893MaRDI QIDQ2638971

Nico M. van Dijk

Publication date: 1991

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02283612

zbMATH Keywords

perturbationserror boundstruncationsJacksonian queueing networkoverflow control

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Markov and semi-Markov decision processes (90C40) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the stationary distribution for infinite Markov chains
• On the Overflow Process from a Finite Markovian Queue
• Simple Bounds and Monotnicity the Call Congestion of Finite Multiserver Delay Systems
• AVERAGE-OPTIMAL ADAPTIVE POLICIES IN SEMI-MARKOV DECISION PROCESSES INCLUDING AN UNKNOWN PARAMETER
• Perturbation theory for unbounded Markov reward processes with applications to queueing
• Perturbation theory for Markov reward processes with applications to queueing systems
• A proof of simple insensitive bounds for a pure overflow system
• Convergence of Dynamic Programming Models
• The Condition of a Finite Markov Chain and Perturbation Bounds for the Limiting Probabilities
• Bounds for the regret loss in dynamic programming under adaptive control
• Truncation of Markov Chains with Applications to Queueing
• Approximations of Dynamic Programs, I
• Perturbation theory and finite Markov chains

This page was built for publication: On truncations and perturbations of Markov decision problems with an application to queueing network overflow control