Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem
Management Science · 1972 · Volume 19 · Issue 1
Abstract
Certain sets of numbers { a in }, i = 0,…, n , n = 1, 2,…, are known characterize an optimal sequential assignment policy. In this paper the limiting behavior as n → ∞ of the a in 's is studied.
Enable JavaScript for citation tools and additional paper interactions.