Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson populations
From MaRDI portal
(Redirected from Publication:323635)
Recommendations
- Lower bounds for expected sample size of sequential procedures for the multinomial selection problems
- Lower Bound for the Average Sample Size and the Efficiency of Ranking Sequential Procedures
- Lower bounds for average sample size and efficiency of sequential selection procedures
- A bound for higher moments of expected sample size in sequential testing
- on the stochastic minimization of sample size by the bechhofer-kulkarni bernoulli sequential selection procedure
- Estimators for a Poisson parameter using ranked set sampling
- On the optimum properties of sequential estimation procedures in the multinomial sampling plans
Cites work
- scientific article; zbMATH DE number 3122741 (Why is no real title available?)
- scientific article; zbMATH DE number 3938347 (Why is no real title available?)
- scientific article; zbMATH DE number 3332035 (Why is no real title available?)
- scientific article; zbMATH DE number 3061365 (Why is no real title available?)
- A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
- An Extension of Paulson's Selection Procedure
- Determination of sample size for selecting the smallest ofkpoisson population means
- Lower Bound for the Average Sample Size and the Efficiency of Ranking Sequential Procedures
- Lower Bounds for Average Sample Size and Efficiency of Statistical Inference Procedures
- Lower bounds for average sample size and efficiency of sequential selection procedures
- On a Conjecture of Bechhofer, Kiefer, and Sobel for the Levin–Robbins–Leu Binomial Subset Selection Procedures
- On selecting a process with the smallest number of unfortunate events
- On the performance characteristics of a closed adaptive sequential procedure for selecting the best bernoulli population
Cited in
(7)- 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
- Algorithm for Calculating the Initial Sample Size in a Fully Sequential Ranking and Selection Procedure
- scientific article; zbMATH DE number 4028616 (Why is no real title available?)
- Lower bounds for expected sample size of sequential procedures for the multinomial selection problems
- scientific article; zbMATH DE number 3956269 (Why is no real title available?)
- scientific article; zbMATH DE number 734970 (Why is no real title available?)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323635)
