Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-24T13:07:49.634Z Has data issue: false hasContentIssue false
  • English
  • Français

Stoppable families of alternative bandit processes

Published online by Cambridge University Press:  14 July 2016

K. D. Glazebrook
K. D. Glazebrook*
Affiliation:
University of Newcastle upon Tyne
*
∗Postal address: Department of Statistics, School of Mathematics, The University of Newcastle upon Tyne, Newcastle upon Tyne NE1 7RU, U.K.
Get access Rights & Permissions [Opens in a new window]

Abstract

Stoppable families of alternative bandit processes are decision processes with the property that at each decision epoch the choice is between allocating service to one of the constituent bandit processes or stopping and deciding in favour of one of them. The problem is considered of finding optimal (or good suboptimal) strategies for such processes. The theory for non-stoppable families leads us to study the performance of a simple strategy. This is shown to be optimal under certain conditions. These conditions are discussed and an example relating to research planning is given.

Keywords

ALTERNATIVE RESEARCH PROJECTSFAMILY OF ALTERNATIVE BANDIT PROCESSESDYNAMIC ALLOCATION INDEXMARKOV DECISION PROCESS
Type
Research Papers
Information
Journal of Applied Probability , Volume 16 , Issue 4 , December 1979 , pp. 843 - 854
Copyright
Copyright © Applied Probability Trust 1979 

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

Blackwell, D. (1962) Discrete dynamic programming. Ann. Math. Statist. 33, 719–726.Google Scholar
Deshmukh, S. D. and Chikte, S. D. (1977) Dynamic investment strategies for a risky R & D project. J. Appl. Prob. 14, 144–152.Google Scholar
Gittins, J. C. (1976) Bandit processes and dynamic allocation indices. Unpublished.Google Scholar
Gittins, J. C. (1979) Bandit processes and dynamic allocation indices. J. R. Statist. Soc. B 41, 148–177.Google Scholar
Gittins, J. C. and Glazebrook, K. D. (1977) On Bayesian models in stochastic scheduling. J. Appl. Prob. 14, 556–565.Google Scholar
Gittins, J. C. and Jones, D. M. (1972) A dynamic allocation index for the sequential design of experiments, In Progress in Statistics , ed. Gani, J. North-Holland, Amsterdam.Google Scholar
Gittins, J. C. and Nash, P. (1978) Scheduling, queues and dynamic allocation indices. Proc. 7th Prague Conference A , Reidel, Dordrecht, 191–202.Google Scholar
Glazebrook, K. D. (1976) A profitability index for alternative research projects. Omega 4, 79–83.Google Scholar
Glazebrook, K. D. (1978) On the optimal allocation of two or more treatments in a controlled clinical trial. Biometrika 65, 335–340.Google Scholar
Glazebrook, K. D. (1978a) Some ranking formulae for alternative research projects. Omega 6, 193–194.Google Scholar
Nash, P. (1973) Optimal Allocation of Resources Between Research Projects. Ph.D. Thesis, Cambridge University.Google Scholar
Ross, S. M. (1970) Applied Probability Models with Optimization Applications. Holden-Day, San Francisco.Google Scholar