On a Conjecture of Bechhofer, Kiefer, and Sobel for the Levin–Robbins–Leu Binomial Subset Selection Procedures
DOI10.1080/07474940801989079zbMath1274.62157OpenAlexW1991349343WikidataQ123220011 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
subset selectionsequential selectionprobability of correct selectionlower-bound formulasBKS conjectureelimination and recruitment proceduresprobability of acceptable selection
Robustness and adaptive procedures (parametric inference) (62F35) Bounds on effective properties in solid mechanics (74Q20) Sequential statistical analysis (62L10) Statistical ranking and selection procedures (62F07)
Related Items (5)
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
This page was built for publication: On a Conjecture of Bechhofer, Kiefer, and Sobel for the Levin–Robbins–Leu Binomial Subset Selection Procedures