A key inequality for lower bound formulas for lattice event probabilities

DOI10.1080/07474946.2021.2010417zbMath1493.62094WikidataQ113850992 ScholiaQ113850992MaRDI QIDQ5861997

Cheng-Shiun Leu, Bruce R. Levin

Publication date: 3 March 2022

Published in: Sequential Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07474946.2021.2010417

zbMATH Keywords

subset selection; sequential selection; probability of correct selection; lower-bound formulas; elimination and recruitment procedures; lattice events; adaptive subset selection; standardized muirhead ratios; multiple-index cusums

Mathematics Subject Classification ID

62F35: Robustness and adaptive procedures (parametric inference)

74Q20: Bounds on effective properties in solid mechanics

62L10: Sequential statistical analysis

62F07: Statistical ranking and selection procedures

Related Items

Proof of a Key Inequality for Lattice Event Probabilities with Equal Odds

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• 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
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Inequalities: theory of majorization and its applications