Optimal stationary policies for denumerable Markov chains in continuous time

DOI10.2307/1426026zbMath0342.60045OpenAlexW4237594416MaRDI QIDQ4110415

John Bather

Publication date: 1976

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

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

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Continuous-time Markov processes on general state spaces (60J25) Discrete-time Markov processes on general state spaces (60J05) Markov and semi-Markov decision processes (90C40) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items

Continuous-time controlled Markov chains. ⋮ Optimal control of a simple immigration-birth-death process through total catastrophes ⋮ Optimal pest control through the introduction of a predator ⋮ Elimination of eanlomization in semi-Markov decision models with average cost criterion ⋮ Explicit solution of the average-cost optimality equation for a pest-control problem ⋮ Optimal control of a simple immigration--emigration process through total catastrophes. ⋮ Computation of the optimal policy for the control of a compound immigration process through total catastrophes ⋮ On the control of a truncated general immigration process through the introduction of a predator ⋮ A semi-Markov decision model for the optimal control of a simple immigration-birth-death process through the introduction of a predator

This page was built for publication: Optimal stationary policies for denumerable Markov chains in continuous time