On a sufficient condition for superprocesses due to whittle

DOI10.2307/3213920zbMath0484.90091OpenAlexW4256697786MaRDI QIDQ3944368

Kevin D. Glazebrook

Publication date: 1982

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

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

zbMATH Keywords

stochastic schedulingnecessary and sufficient conditionstochastic resource allocationsuperprocessesdynamic allocation indicesresearch planningexistence conditions for optimal strategiesfamilies of alternative bandit processesstoppable process

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Related Items (5)

The performance of forwards induction policies ⋮ Stochastic scheduling and forwards induction ⋮ Competing Markov decision processes ⋮ Multi-armed bandit processes with optimal selection of the operating times ⋮ Branching bandits: A sequential search process with correlated pay-offs.

This page was built for publication: On a sufficient condition for superprocesses due to whittle