This paper presents new methods for selecting the best population value under the classical secretary problem sequential selection rules. Unlike the classical case, the possible population arrival sequences considered here are not necessarily equally likely. When arrival orders in the sequence are rank dependent, the performance of the optimal solution to the standard problem (totally random arrival order assumed) is very poor, compared with procedures designed to guard against non-uniform arrival orders.
