Proof of a lower bound formula for the expected reward in the levin-robbins sequential elimination procedure
From MaRDI portal
Publication:4254239
DOI10.1080/07474949908836423zbMATH Open0931.62067OpenAlexW2323205486MaRDI QIDQ4254239FDOQ4254239
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1347893
- On a Conjecture of Bechhofer, Kiefer, and Sobel for the Levin–Robbins–Leu Binomial 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
- A comparison of two procedures to select the best binomial population with sequential elimination of inferior populations
Cites Work
Cited In (5)
- On a Conjecture of Bechhofer, Kiefer, and Sobel for the Levin–Robbins–Leu Binomial Subset Selection Procedures
- A comparison of two procedures to select the best binomial population with sequential elimination of inferior populations
- Simple Sequential Boundaries for Treatment Selection in Multi‐Armed Randomized Clinical Trials with a Control
- 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
This page was built for publication: Proof of a lower bound formula for the expected reward in the levin-robbins sequential elimination procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4254239)
