Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson populations

DOI10.1134/S1995080216040119zbMath1419.62038MaRDI QIDQ323635

Mohammad Hasan, M. Dambrine

Publication date: 10 October 2016

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

rankingefficiencyselectionindifference zoneexpected sample sizebinomial populationslower bounds for expected sample sizePoisson populations

Mathematics Subject Classification ID

Sequential statistical analysis (62L10) Statistical ranking and selection procedures (62F07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower Bounds for Average Sample Size and Efficiency of Sequential Selection Procedures
• Lower Bound for the Average Sample Size and the Efficiency of Ranking Sequential Procedures
• On selecting a process with the smallest number of unfortunate events
• On a Conjecture of Bechhofer, Kiefer, and Sobel for the Levin–Robbins–Leu Binomial Subset Selection Procedures
• On the performance characteristics of a closed adaptive sequential procedure for selecting the best bernoulli population
• Lower Bounds for Average Sample Size and Efficiency of Statistical Inference Procedures
• Determination of sample size for selecting the smallest ofkpoisson population means
• An Extension of Paulson's Selection Procedure
• A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances

This page was built for publication: Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson populations