Semi-Markov decision processes with polynomial reward

DOI10.2307/3213482zbMath0479.90082OpenAlexW4233037133MaRDI QIDQ3937165

Zvi Rosberg

Publication date: 1982

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213482

zbMATH Keywords

semi-Markov decision processstationary optimal policyunbounded rewarddenumerable multidimensional state spaceergodicity assumptionlong-run average reward criterionqueueing network scheduling

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (2)

Arbitrary state semi-Markov decision processes ⋮ Performance analysis for controlled semi-Markov systems with application to maintenance

This page was built for publication: Semi-Markov decision processes with polynomial reward