ON SELECTION PROCEDURES BASED ON RANKS: COUNTER-EXAMPLES CONCERNING LEAST FAVORABLE CONFIGURATIONS.

The paper is concerned with certain multiple-decision procedures based on ranks which have been proposed for analyzing data in a one-way layout: X sub ij = theta sub i + epsilon sub ij, i = 1,...,k, j =1,...,n where the errors (epsilon sub ij) are independent, have the same known cumulative distribution function (cdf) F and where theta = (theta sub 1,...,theta sub k) is unknown. Two problems are considered: (1) Select the indices of the t largest theta-values. (2) Select a subset containing the index of the largest theta-value. (Author)
Prepared in cooperation with Ohio State Univ., Columbus, contract NASA-NGR36-008-040.