Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem

Published Online:https://doi.org/10.1287/mnsc.19.1.46

Certain sets of numbers {ain}, i = 0,…, n, n = 1, 2,…, are known characterize an optimal sequential assignment policy. In this paper the limiting behavior as n → ∞ of the ain's is studied.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.