Selection from among n objects by relative rank with no recall - the "secretary problem"-in the asymptotic case when n → ∞ is considered, assuming that k, the cost ratio, becomes very large and k= k/n is kept to be a, finite constant. It is known that in the "low cost" case where K = kn is kept to be a non-negative finite constant, the expected number of observations comes out to be O(n) and the expected absolute rank of the selected object comes out to be O(1), and that in the "medium cost" case where k is kept, to be a positive finite constant, both expected values come out to be O(√<n>). Here the former comes out to be O(1) and t,he latter O(n). The graph of total "loss" vs. k looks like a continuous broken line, while those of "expected cost of observations" and "expected absolute rank" have jumps at many points. As k approaches O, the curves approach smooth ones corresponding to the "medium cost" case.
View full abstract