On an Inequality That Implies the Lower Bound Formula for the Probability of Correct Selection in the Levin-Robbins-Leu Family of Sequential Binomial Subset Selection Procedures.

We study a key inequality that implies the lower bound formula for the probability of correct selection and other selection-related events of interest in the Levin-Robbins-Leu family of sequential binomial subset selection procedures. We present a strategy for the proof of the key inequality, and a mostly-complete general proof is given. The strategy provides an entirely complete and rigorous proof of the inequality for as many as seven competing populations using computer-assisted symbolic manipulation.