Selecting the highest probability in binomial or multinomial trials

DOI10.1073/pnas.78.8.4663zbMath0473.62069OpenAlexW2080945261WikidataQ35450809 ScholiaQ35450809MaRDI QIDQ3928082

Bruce R. Levin

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)

Related Items (10)

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 ⋮ 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 ⋮ A Bayesian Inference and Stochastic Dynamic Programming Approach to Determine the Best Binomial Distribution ⋮ A stopping rule for choosing the best of three coins ⋮ On lattice event probabilities for Levin-Robbins-Leu subset selection procedures ⋮ On Calculations Involving the Maximum Cell Frequency

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