Proof of a lower bound formula for the expected reward in the levin-robbins sequential elimination procedure

DOI10.1080/07474949908836423zbMath0931.62067OpenAlexW2323205486MaRDI QIDQ4254239

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

zbMATH Keywords

sequential eliminationexpected rewardlower bound formula

Mathematics Subject Classification ID

Sequential statistical analysis (62L10) Sequential estimation (62L12)

Related Items (5)

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 ⋮ On lattice event probabilities for Levin-Robbins-Leu subset selection procedures

Cites Work

• Selecting the highest of three binomial probabilities
• Selecting the highest probability in binomial or multinomial trials

This page was built for publication: Proof of a lower bound formula for the expected reward in the levin-robbins sequential elimination procedure