A simple algorithm for the adaptation of scores and power behavior of the corresponding rank test

The purpose of this paper is twofold:On one hand we want to give a very simple algorithm for evaluating a special rank estimator of the type given in Behnen, Neuhaus, and Ruymgaart (1983) for the approximate optimal choice of the scores-generating function of a two-sample linear rank test for the general testing problem H_o:F=G versus H₁:F ≤ G, F ≠ G, in order to demonstrate that the corresponding adaptive rank statistic is simple enough for practical applications. On the other hand we prove the asymptotic normality of the adaptive rank statistic under H (leading to approximate critical values) and demonstrate the adaptive behavior of the corresponding rank test by a Monte Carlo power simulation for sample sizes as low as m=10, n=10.