Selecting the highest probability in binomial or multinomial trials

DOI10.1073/PNAS.78.8.4663MaRDI QIDQ3928082zbMATH OpenOpenAlexWikidataFDO

Authors Bruce R. Levin, Herbert Robbins

Publication date 1981

Published in Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1073/pnas.78.8.4663

zbMATH Keywords

numerical resultsMonte Carlo experimentsk-sample problem

Mathematics Subject Classification ID

Sequential statistical analysis (62L10)

Cited in

(10)

• On Calculations Involving the Maximum Cell Frequency
• On a Conjecture of Bechhofer, Kiefer, and Sobel for the Levin–Robbins–Leu Binomial Subset Selection Procedures
• Proof of a lower bound formula for the expected reward in the levin-robbins sequential elimination procedure
• On a sequential selection procedure of Bechhofer, Kiefer, and Sobel
• 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
• Simple Sequential Boundaries for Treatment Selection in Multi‐Armed Randomized Clinical Trials with a Control
• A stopping rule for choosing the best of three coins
• On lattice event probabilities for Levin-Robbins-Leu subset selection procedures
• A Bayesian Inference and Stochastic Dynamic Programming Approach to Determine the Best Binomial Distribution

This page was built for publication: Selecting the highest probability in binomial or multinomial trials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3928082)