Lower bounds for average sample size and efficiency of sequential selection procedures

DOI10.1137/S0040585X97985935MaRDI QIDQ2845210zbMATH OpenFDO

Authors I. A. Kareev

Publication date 22 August 2013

Published in Theory of Probability and its Applications (Search for Journal in Brave)

zbMATH Keywords

efficiencyselectionlower bounds for average sample size

Mathematics Subject Classification ID

Sequential statistical analysis (62L10) General considerations in statistical decision theory (62C05)

Recommendations

• Lower Bound for the Average Sample Size and the Efficiency of Ranking Sequential Procedures
• Lower bounds for expected sample size of sequential procedures for the multinomial selection problems
• Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson populations
• An optimal sequential selection procedure
• Publication:3198742

Cited in

(5)

• Lower Bound for the Average Sample Size and the Efficiency of Ranking Sequential Procedures
• scientific article; zbMATH DE number 3846698 (Why is no real title available?)
• Lower bounds for expected sample size of sequential procedures for the multinomial selection problems
• Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson populations
• scientific article; zbMATH DE number 3984378 (Why is no real title available?)

This page was built for publication: Lower bounds for average sample size and efficiency of sequential selection procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845210)