Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem

Chris Albright and Cyrus Derman
Additional contact information
Chris Albright: Stanford University.
Cyrus Derman: Columbia University

Management Science, 1972, vol. 19, issue 1, 46-51

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 -> \infty of the a in 's is studied.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.1.46 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:19:y:1972:i:1:p:46-51

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().