This report identifies the configuration that minimizes the (s,t)-lower bound for the probability of theta-acceptable subset selection, which is involved in the proof of a conjecture of Bechhofer, Kiefer, and Sobel for the Levin-Robbins-Leu binomial subset selection procedure with sequential elimination and recruitment.
Statistical Methodology | Statistical Theory
Levin, Bruce, "On Minimizing the Lower Bound for the Probability of Acceptable Subset Selection" (November 2006). Columbia University Biostatistics Technical Report Series. Working Paper 7.