Computation of optimal policies in discounted semi-Markov decision chains

DOI10.1007/BF01719612zbMATH Open0536.90094OpenAlexW2015533741MaRDI QIDQ792229FDOQ792229

Authors: L. Cantaluppi 

Publication date: 1984

Published in: OR Spektrum (Search for Journal in Brave)

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

Recommendations

• Optimality of Piecewise-Constant Policies in Semi-Markov Decision Chains
• Discounted semi-Markov decision processes with nonnegative costs
• Computing semi-stationary optimal policies for multichain semi-Markov decision processes
• Solutions of semi-Markov control models with recursive discount rates and approximation by \(\epsilon\)-optimal policies.
• Performance optimization of semi-Markov decision processes with discounted-cost criteria

zbMATH Keywords

convergence analysissuccessive approximationsepsilon-optimal policyexpected discounted rewardfinite-state semi-Markov process

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Cites Work

• Finite state continuous time Markov decision processes with an infinite planning horizon
• Finite State Continuous Time Markov Decision Processes with a Finite Planning Horizon
• Markov-Renewal Programming. I: Formulation, Finite Return Models
• Title not available (Why is that?)
• Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
• Approximations of Dynamic Programs, I
• Multichain Markov Renewal Programs
• Optimal Replacement Rules when Changes of State are Semi-Markovian
• Approximations of Dynamic Programs, II
• Linear programming algorithms for semi-Markovian decision processes
• Continuous Time Markovian Sequential Control Processes
• Optimality of Piecewise-Constant Policies in Semi-Markov Decision Chains

Cited In (6)

• Optimality of Piecewise-Constant Policies in Semi-Markov Decision Chains
• Markov branching decision chains with interest-rate-dependent rewards
• Computing semi-stationary optimal policies for multichain semi-Markov decision processes
• Polynomial-Time Computation of Strong and n-Present-Value Optimal Policies in Markov Decision Chains
• Title not available (Why is that?)
• Undiscounted Markov decision chains with partial information; an algorithm for computing a locally optimal periodic policy

This page was built for publication: Computation of optimal policies in discounted semi-Markov decision chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792229)