Asymptotic Optimal Policies for the Stochastic Sequential Assignment Problem.
Abstract
In the paper a sequential assignment problem is discussed. There are n men with values, or efficiencies, P(sub 1)< or =, ..., < or = p(sub n), and these men must be paired with n jobs which come in sequentially. The values of the jobs are X(sub 1),...,X(sub n), assumed to be independent, identically distributed random variables with a known distribution function F. It is assumed that if a p man is assigned to an x job, a reward of px is obtained. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 28, 1971
- Accession Number
- AD0728408
Entities
People
- Chris Albright
- Cyrus Derman
Organizations
- Stanford University