On a sufficient condition for superprocesses due to whittle
Journal of Applied ProbabilityPublished 1 March 1982
K. D. Glazebrook
Citations30
SJR quartileQ2
SJR score0.53
SNIP0.91
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Whittle has given a sufficient condition for a certain class of Markov decision processes to have an optimal strategy of a particularly simple form. We show this condition to be necessary in a certain sense and give some examples of its application.
Keywords
Computer ScienceEngineering
Journal of the Royal Statistical Society Series B (Statistical Methodology)Multi-Armed Bandits and the Gittins Index
530 Citations1980Peter Whittle
SIAM Journal on Applied MathematicsSingle-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
142 Citations1972W. A. Horn
Simple algorithms are given to find an allowable solution with minimum penalty in the two cases where all precedence relations in each tree go “inward,” toward the root, or away from the root (where the root is a particular tip node of the tree).
Journal of Applied ProbabilityOn Bayesian models in stochastic scheduling
76 Citations1977John Gittins, K. D. Glazebrook
International Journal of Systems ScienceStochastic scheduling with order constraints
64 Citations1976K. D. Glazebrook
The problem is to find a strategy of allocating service which minimizes the total expected costs of all jobs in the system and which observes the order constraints.
Journal of Applied ProbabilityStoppable families of alternative bandit processes
43 Citations1979K. D. Glazebrook