On a Conjecture of Bechhofer, Kiefer, and Sobel for the Levin–Robbins–Leu Binomial Subset Selection Procedures

DOI10.1080/07474940801989079zbMath1274.62157WikidataQ123220011 ScholiaQ123220011MaRDI QIDQ3518363

Cheng-Shiun Leu, Bruce R. Levin

Publication date: 7 August 2008

Published in: Sequential Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07474940801989079

zbMATH Keywords

subset selection; sequential selection; probability of correct selection; lower-bound formulas; BKS conjecture; elimination and recruitment procedures; probability of acceptable selection

Mathematics Subject Classification ID

62F35: Robustness and adaptive procedures (parametric inference)

74Q20: Bounds on effective properties in solid mechanics

62L10: Sequential statistical analysis

62F07: Statistical ranking and selection procedures

Related Items

Proof of a Key Inequality for Lattice Event Probabilities with Equal Odds, Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson 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, Partitioning Bernoulli Populations with Respect to a Control

Cites Work

• Unnamed Item
• On a sequential selection procedure of Bechhofer, Kiefer, and Sobel
• 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
• On Some Multiple Decision (Selection and Ranking) Rules
• A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances