  We consider the stochastic sequential assignment problem of Derman, Lieberman
and Ross (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 \to \infty$.
