Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem
Certain sets of numbers {a<sub>in</sub>}, i = 0,..., n, n = 1, 2,..., are known characterize an optimal sequential assignment policy. In this paper the limiting behavior as n -> \infty of the a<sub>in</sub>'s is studied.