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
From MaRDI portal
Publication:2941680
DOI10.1080/07474946.2013.843321zbMath1319.62045OpenAlexW2052677759WikidataQ42875453 ScholiaQ42875453MaRDI QIDQ2941680
Cheng-Shiun Leu, Bruce R. Levin
Publication date: 24 August 2015
Published in: Sequential Analysis (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc3835311
subset selectionsequential selectionprobability of correct selectionlower-bound formulaselimination and recruitment proceduresadaptive subset selectionstandardized muirhead ratios
Robustness and adaptive procedures (parametric inference) (62F35) Sequential statistical analysis (62L10) Statistical ranking and selection procedures (62F07)
Related Items
Proof of a Key Inequality for Lattice Event Probabilities with Equal Odds, 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, Positivity of cumulative sums for multi-index function components explains the lower bound formula in the Levin-Robbins-Leu family of sequential subset selection procedures, On lattice event probabilities for Levin-Robbins-Leu subset selection procedures, A key inequality for lower bound formulas for lattice event probabilities
Cites Work
- Unnamed Item
- Unnamed Item
- A comparison of two procedures to select the best binomial population with sequential elimination of inferior populations
- 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
- Selecting the highest of three binomial probabilities
- Selecting the highest probability in binomial or multinomial trials
- Proof of a lower bound formula for the expected reward in the levin-robbins sequential elimination procedure
- Inequalities: theory of majorization and its applications