Abstract
We introduce and discuss some key inequalities that underlie the lower bound formula for the probability of lattice events in the Levin-Robbins-Leu family of sequential subset selection procedures for binary outcomes. The present work combines the notion of lattice events—as previously discussed for the nonadaptive member of the family—with the positive cumulative sum property for the adaptive members—as previously discussed for the special lattice event of correct selection, thereby extending the key inequality to its broadest scope.
ACKNOWLEDGEMENT
We thank the Editor for his tireless efforts on our behalf.
DISCLOSURE
The authors have no conflicts of interest to report.