Hostname: page-component-7c8c6479df-ws8qp Total loading time: 0 Render date: 2024-03-29T02:02:48.677Z Has data issue: false hasContentIssue false

On a sufficient condition for superprocesses due to whittle

Published online by Cambridge University Press:  14 July 2016

K. D. Glazebrook*
Affiliation:
University of Newcastle upon Tyne
*
Postal address: School of Mathematics, The University of Newcastle upon Tyne, Newcastle upon Tyne NE1 7RU, U.K.

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.

Type
Research Paper
Copyright
Copyright © Applied Probability Trust 1982 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Gittins, J. C. and Glazebrook, K. D. (1977) On Bayesian models in stochastic scheduling. J. Appl. Prob. 14, 556565.Google Scholar
Gittins, J. C. and Jones, D. M. (1974) A dynamic allocation index for the sequential design of experiments. In Progress in Statistics, ed. Gani, J., North Holland, Amsterdam, 241266.Google Scholar
Glazebrook, K. D. (1976) Stochastic scheduling with order constraints. Internat. J. Systems Sci. 7, 657666.Google Scholar
Glazebrook, K. D. (1979) Stoppable families of alternative bandit processes. J. Appl. Prob. 16, 843854.Google Scholar
Horn, W. A. (1972) Single machine job sequencing with tree-like precedence ordering and linear delay penalties. SIAM J. Appl. Math. 23, 189202.Google Scholar
Nash, P. (1973) Optimal Allocation of Resources Between Research Projects. Ph.D. Thesis, Cambridge University.Google Scholar
Whittle, P. (1980) Multi-armed bandits and the Gittins index. J.R. Statist. Soc. B 42, 143149.Google Scholar