A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs

DOI10.1007/BF01917174zbMath0467.90072OpenAlexW1989955259MaRDI QIDQ3921021

Dieter Spreen

Publication date: 1981

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityconvergencepolicy iteration algorithmundiscounted Markov renewal programsno discountinganticycling rulemultichain Markov renewal programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Markov and semi-Markov decision processes (90C40)

Related Items (1)

A value iteration method for undiscounted multichain Markov decision processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Foolproof convergence in multichain policy iteration
• A New Specification of the Multichain Policy Iteration Algorithm in Undiscounted Markov Renewal Programs
• Markov-Renewal Programming. I: Formulation, Finite Return Models
• Discrete Dynamic Programming
• Multichain Markov Renewal Programs

This page was built for publication: A further anticycling rule in multichain policy iteration for undiscounted Markov renewal programs