Subset selection for exponential populations : determination of the selection constant

Given are k (\geq 2) exponential populations differing only in their location parameter. One wishes to choose the best one, that is the population with the largest value of the location parameter. A possible method for solving this problem is to select a subset of the k populations of size at least one which includes the best population with a required confidence P*(k^{-1} <P* <1). In this paper the required selection constant is determined for different values of k and P*. Also an approximation for the selection constant is derived. A comparison with the exact results is made