Rank tests for the k-sample problem with restricted alternatives

Abstract

An asymptotically maximin most powerful rank test among somewhere asymptotically most powerful linear rank tests with scores generating function cf> is derived for each of the simple order alternative, the simple loop alternative and the simple tree alternative in the k-sample problem. The comparisons of the tests obtained with the rank analogues of the Bartholomew's xv tests are made in terms of local asymptotic relative efficiency. It is found that our tests are better than the rank analogues of the xk tests. Furthermore, the asymptotic equivalence of the ranking by the pooled sample to the ranking in pairs are discuss¬ed and the tests which are asymptotically equivalent to ours are given.

Keywords:

• maximin most powerful linear rank test
• Bartholome's x^-2x^k test
• local efficiency
• simple order alternative
• simple loop alternative
• simple tree alternative