Back To Index Previous Article Next Article Full Text


Statistica Sinica 18(2008), 203-218





A GENERALIZATION OF THE LEVIN-ROBBINS

PROCEDURE FOR BINOMIAL SUBSET SELECTION

AND RECRUITMENT PROBLEMS



Cheng-Shiun Leu$^{1,2}$ and Bruce Levin$^2$


$^{1}$New York State Psychiatric Institute and $^2$Columbia University


Abstract: We introduce a family of sequential selection and recruitment procedures for the subset identification problem in binomial populations. We demonstrate the general validity of a simple formula providing a lower bound for the probability of correct identification in a version of the family without sequential elimination or recruitment. A new application of the non-central hypergeometric distribution is revealed. A similar theorem is conjectured to hold for the more efficient version which employs sequential elimination or recruitment.



Key words and phrases: Lower bound formula, probability of correct selection, recruitment, selection, sequential identification.

Back To Index Previous Article Next Article Full Text