A UNIFIED APPROACH TO ALGORITHMS WITH A SUBOPTIMALITY TEST IN DISCOUNTED SEMI-MARKOV DECISION PROCESSES

DOI10.15807/JORSJ.24.296zbMath0475.90088OpenAlexW2727047896MaRDI QIDQ3931047

Katsuhisa Ohno

Publication date: 1981

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.24.296

zbMATH Keywords

computational algorithmscomparison of algorithmsoptimal stationary policyminimum costsuboptimality testdiscounted semi-Markov decision processequivalent decision processesmodified policy iteration algorithm

Mathematics Subject Classification ID

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

Related Items (3)

Variational characterizations in Markov decision processes ⋮ Replacement process decomposition for discounted Markov renewal programming ⋮ Bounds on the fixed point of a monotone contraction operator

This page was built for publication: A UNIFIED APPROACH TO ALGORITHMS WITH A SUBOPTIMALITY TEST IN DISCOUNTED SEMI-MARKOV DECISION PROCESSES