Proof of a lower bound formula for the expected reward in the levin-robbins sequential elimination procedure
From MaRDI portal
Publication:4254239
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 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 lattice event probabilities for Levin-Robbins-Leu 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)