On undiscounted semi-Markov decision processes with absorbing states

DOI10.1007/S00186-015-0524-YMaRDI QIDQ283987zbMATH OpenOpenAlexFDO

Authors P. Mondal

Publication date 17 May 2016

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-015-0524-y

zbMATH Keywords

limiting ratio average reward criterionlinear programming algorithmoptimal semi-stationary policiessemi-Markov decision processes

Mathematics Subject Classification ID

Linear programming (90C05) Markov renewal processes, semi-Markov processes (60K15) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Markov and semi-Markov decision processes (90C40)

Recommendations

• Semi-infinite Markov decision processes
• Non-stationary semi-Markov decision processes on a finite horizon
• Semi-Markov decision processes with a reachable state-subset
• Arbitrary state semi-Markov decision processes
• scientific article; zbMATH DE number 1159485
• A survey on semi-Markov decision processes
• Denumerable-state continuous-time Markov decision processes with unbounded transition and reward rates under the discounted criterion
• On undiscounted markovian decision processes with compact action spaces

Cites work

• scientific article; zbMATH DE number 3128726 (Why is no real title available?)
• scientific article; zbMATH DE number 3514781 (Why is no real title available?)
• scientific article; zbMATH DE number 3208653 (Why is no real title available?)
• scientific article; zbMATH DE number 3338194 (Why is no real title available?)
• scientific article; zbMATH DE number 3062448 (Why is no real title available?)
• scientific article; zbMATH DE number 3078991 (Why is no real title available?)
• A Note on Memoryless Rules for Controlling Sequential Control Processes
• A Survey of Applications of Markov Decision Processes
• A note on simultaneous recurrence conditions on a set of denumerable stochastic matrices
• Algorithms for Countable State Markov Decision Models with an Absorbing Set
• Average Cost Semi-Markov Decision Processes and the Control of Queueing Systems
• Constrained Semi-Markov decision processes with average rewards
• Discrete Dynamic Programming
• Linear programming and zero-sum two-person undiscounted semi-Markov games
• Markov-Renewal Programming. I: Formulation, Finite Return Models
• On Average Reward Semi-Markov Decision Processes with a General Multichain Structure
• On sequential decisions and Markov chains
• On the Second Optimality Equation for Semi-Markov Decision Models
• Ordered field property for semi-Markov games when one player controls transition probabilities and transition times
• Recursive Repeated Games with Absorbing States
• SEMI-MARKOV DECISION PROCESSES
• Solving semi-Markov decision problems using average reward reinforcement learning
• The Functional Equations of Undiscounted Markov Renewal Programming

Cited in

(9)

• Semi-stationary equilibrium strategies in non-cooperative \(N\)-person semi-Markov games
• The Borel state space semi-Markov decision process with expected total rewards in a semi-Markov environment
• Algorithms for Countable State Markov Decision Models with an Absorbing Set
• On zero-sum two-person undiscounted semi-Markov games with a multichain structure
• scientific article; zbMATH DE number 3969813 (Why is no real title available?)
• Special subclass of generalized semi-Markov decision processes with discrete time
• Computing semi-stationary optimal policies for multichain semi-Markov decision processes
• Semi-Markov decision processes with limiting ratio average rewards
• Semi-Markov decision processes with vector pay-offs

This page was built for publication: On undiscounted semi-Markov decision processes with absorbing states

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