Proof of a lower bound formula for the expected reward in the levin-robbins sequential elimination procedure
From MaRDI portal
Publication:4254239
DOI10.1080/07474949908836423zbMath0931.62067MaRDI QIDQ4254239
Cheng-Shiun Leu, Bruce R. Levin
Publication date: 21 February 2000
Published in: Sequential Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/07474949908836423
Related Items
A comparison of two procedures to select the best binomial population with sequential elimination of inferior populations, On lattice event probabilities for Levin-Robbins-Leu subset selection procedures, 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, On a Conjecture of Bechhofer, Kiefer, and Sobel for the Levin–Robbins–Leu Binomial Subset Selection Procedures, Simple Sequential Boundaries for Treatment Selection in Multi‐Armed Randomized Clinical Trials with a Control
Cites Work