Proof of a Key Inequality for Lattice Event Probabilities with Equal Odds
DOI10.1080/07474946.2022.2129689OpenAlexW4310055951MaRDI QIDQ5058155FDOQ5058155
Authors: Cheng-Shiun Leu, Bruce R. Levin
Publication date: 19 December 2022
Published in: Sequential Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/07474946.2022.2129689
subset selectionprobability of correct selectionsequential selectionlower-bound formulaselimination and recruitment procedureslattice eventsadaptive subset selectionpositive cusum property
Statistical ranking and selection procedures (62F07) Sequential statistical analysis (62L10) Robustness and adaptive procedures (parametric inference) (62F35) Bounds on effective properties in solid mechanics (74Q20)
Cites Work
- Inequalities: theory of majorization and its applications
- On a Conjecture of Bechhofer, Kiefer, and Sobel for the Levin–Robbins–Leu Binomial Subset Selection Procedures
- Title not available (Why is that?)
- 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
- A key inequality for lower bound formulas for lattice event probabilities
- Positivity of cumulative sums for multi-index function components explains the lower bound formula in the Levin-Robbins-Leu family of sequential subset selection procedures
This page was built for publication: Proof of a Key Inequality for Lattice Event Probabilities with Equal Odds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058155)