Abstract
The purpose of this report is to prove the validity of the lower bound formula for a sequential identification procedure with elimination of inferior coins in the special case of selecting the best b = 2 out of c = 4 coins for any r greater than or equal to 1. This is the first non-trivial case of a general conjecture not already proven in previous work and suggests a rigorous proof of the general conjecture may yet be possible.
Disciplines
Statistical Methodology | Statistical Theory
Suggested Citation
Leu, Cheng-Shiun and Levin, Bruce, "Tech Report #B-91---Selecting the Best Subset of b Out of c Coins with the Levin-Robbins Sequential Elimination Procedure: Proof of the Lower Bound Formula for the Probability of Correct Selection in the Case b=2 and c=4." (July 2004). Columbia University Biostatistics Technical Report Series. Working Paper 3.
http://biostats.bepress.com/columbiabiostat/art3
Comments
This technical report is cited in Leu and Levin (2006), "A Generalization of the Levin-Robbins Procedure for Binomial Subset Selection and Recruitment Problems" to appear in Statistica Sinica.