- Proof of the Lower Bound Formula for the Probability of Correct Binomial Subset Selection with the Levin-Robbins-Leu Sequential Elimination and Recruitment Procedure in the Case b=2, c=4.
- Download the Paper Forward to a colleague
- Abstract:
- We prove the validity of a lower bound for the probability of correct subset selection for choosing the best b=2 binomial populations out of c=4. The procedure considered combines sequential elimination of inferior populations and simultaneous sequential recruitment of superior populations. This extends the results of Leu and Levin (2004) to this new procedure.
- Subject Area:
- Statistical Theory and Methods
- Suggested Citation:
Cheng-Shiun Leu and Bruce Levin, "Proof of the Lower Bound Formula for the Probability of Correct Binomial Subset Selection with the Levin-Robbins-Leu Sequential Elimination and Recruitment Procedure in the Case b=2, c=4." (December 2006). Columbia University Biostatistics Technical Report Series. Working Paper 6.
http://biostats.bepress.com/columbiabiostat/papers/art6