Hostname: page-component-6898cfcb55-w5hgh Total loading time: 0 Render date: 2026-11-11T18:45:12.947Z Has data issue: false hasContentIssue false

Randomised allocation of treatments in sequential trials

Published online by Cambridge University Press:  01 July 2016

John Bather*
Affiliation:
University of Sussex
*
∗ Postal address: School of Mathematical and Physical Sciences, The University of Sussex, Falmer, Brighton BN1 9QH, U.K.

Abstract

Given a finite number of different experiments with unknown probabilities p 1, p 2, ···, p k of success, the multi-armed bandit problem is concerned with maximising the expected number of successes in a sequence of trials. There are many policies which ensure that the proportion of successes converges to p = max (p 1, p 2, ···, p k ), in the long run. This property is established for a class of decision procedures which rely on randomisation, at each stage, in selecting the experiment for the next trial. Further, it is suggested that some of these procedures might perform well over any finite sequence of trials.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1980 

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.)

Article purchase

Temporarily unavailable