We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/Sequential Generalized Likelihood Ratios and Adaptive Treatment Allocation for Optimal Sequential Selection
PeriodicalsMathematics

Sequential Generalized Likelihood Ratios and Adaptive Treatment Allocation for Optimal Sequential Selection

Checking your access to this record.

Abstract & Overview

Given k ≥ 2 populations from an exponential family, we consider herein the problem of efficient sequential selection of the population with the largest mean subject to a correct selection probability constraint. The selection procedure consists of a sampling rule, a stopping rule, and a terminal decision rule. Efficiency at every parameter configuration is measured by the expected total sampling cost together with the correct selection probability. By using sequential generalized likelihood ratio tests of multiple hypotheses and an adaptive sampling rule based on a constrained optimization problem, we show that it is possible to achieve asymptotic efficiency at the true (but unknown) parameter configuration as the probability of incorrect selection approaches 0, thereby resolving a number of open problems in this area. Finite-sample efficiency of the proposed procedure is demonstrated in simulation studies that also compare the procedure with other sequential selection procedures in the literature. Recommended by N. Mukhopadhyay

Cite this record

Hock Peng Chan, Tze-Leung Lai (2006). Sequential Generalized Likelihood Ratios and Adaptive Treatment Allocation for Optimal Sequential Selection. Sequential Analysis, 25(2), 179–201. https://doi.org/10.1080/07474940600596695

Copy in another style

Chan, H. P., & Lai, T. (2006). Sequential Generalized Likelihood Ratios and Adaptive Treatment Allocation for Optimal Sequential Selection. Sequential Analysis, 25(2), 179–201. https://doi.org/10.1080/07474940600596695
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.