Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Some Robust Selection Procedures

Ronald H. Randles
The Annals of Mathematical Statistics
Vol. 41, No. 5 (Oct., 1970), pp. 1640-1645
Stable URL: http://www.jstor.org/stable/2239869
Page Count: 6
  • Read Online (Free)
  • Download ($19.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Some Robust Selection Procedures
Preview not available

Abstract

Let Xit (t = 1,⋯, n; i = 1,⋯, k) be independent observations from k populations with respective distribution functions F(x - θi), where the translation parameters θi are unknown. Consider the problem of selecting one population, the objective being to select the population with largest translation parameter. Procedures based on the joint ranking of all nk observations have been considered by Lehmann [5], Bartlett and Govindarajulu [1], and Puri and Puri [9]. Robust procedures for related problems have been considered by Sobel [11] and McDonald and Gupta [7], among others. Define the ith population to be good if $\theta_i > \theta_{\max} - \Delta$ where θmax = max {θ1,⋯, θk} and where Δ is a specified positive constant. The asymptotic relative efficiency (A.R.E.) of two procedures is then the limiting ratio of the sample sizes required to achieve a preassigned minimum probability of selecting a good population. It was hoped that procedures based on ranks would be more robust in terms of A.R.E. than corresponding parametric procedures. However, it has recently been shown that the slippage configuration used to find the A.R.E. in references [5] and [1] was not least favorable for the selection of a good population (See reference [10].). Puri and Puri [9] avoided this difficulty by restricting consideration to parameter points θ(n) = (θ1 (n),⋯, θ(n) k) for which θ(n) max - θ(n) i = bi/n1/2 + 0(1/n 1/2) for i = 1,⋯, k, where the bi are nonnegative constants. In Section 2, selection procedures are defined which are based on two-sample estimates of shift. It is shown in Section 3 that if the underlying distribution F(x) is absolutely continuous then the procedures defined in Section 2 will select a unique population. Conditions are given under which the slippage configuration is the least favorable parameter point for the selection of a good population. This result does not require restrictions on the set of translation parameters comprising the parameter space. The A.R.E. of these procedures is defined in Section 4. If we consider the procedure based on the Hodges-Lehmann estimates of shift corresponding to the two-sample F0-scores test, it is shown that the A.R.E. of this procedure relative to the normal theory procedure of Bechhofer [2] is simply the Pitman efficiency of the two-sample F0-scores test relative to the t-test. Hence this approach yields efficiency results which are similar to those in references [5], [1], and [9]. However, the use of estimates in the definition of the selection procedure has the advantage of eliminating the difficulties concerning the least favorable parameter point.

Page Thumbnails

  • Thumbnail: Page 
1640
    1640
  • Thumbnail: Page 
1641
    1641
  • Thumbnail: Page 
1642
    1642
  • Thumbnail: Page 
1643
    1643
  • Thumbnail: Page 
1644
    1644
  • Thumbnail: Page 
1645
    1645