The Stochastic Sequential Assignment Problem with Arrivals
Publication Date: July 21, 2011
R. Righter, “The Stochastic Sequential Assignment Problem with Arrivals,” Probability in the Engineering and Informational Sciences, 2011.
Abstract: We extend the classic sequential stochastic assignment problem to include arrivals of workers. When workers are all of the same type, we show that the socially optimal policy is the same as the individually optimal policy for which workers are given priority according to last come–first served. This result also holds under several variants in the model assumptions. When workers have different types, we show that the socially optimal policy is determined by thresholds such that more valuable jobs are given to more valuable workers, but now the individually optimal policy is no longer socially optimal. We also show that the overall value increases when worker or job values become more variable.