Abstract
We consider the stochastic sequential assignment problem of Derman et al. (1972) corresponding to a discrete distribution supported on a finite set of points. We use large deviation estimates to compute the asymptotics of the optimal policy as the number of tasks N→∞.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
