A fixed subset-size approach to the selection problem

Abstract

The problem considered is that of selecting a subset of the smallest possible fixed size s that will contain the t best of k populations (t ≤ s ≤ k), based on any given common sample size from each of the k populations. Special emphasis, with a table included for finding s, is given to the case of normal distributions with larger means being better and with a common known variance. A criterion for efficiency, comparisons with other procedures, and a dual problem are also discussed.