Sequential Stochastic Assignment Problem With Rejection
Tōru Nakai · Journal of Information and Optimization Sciences · 1981
Suppose there are n men to seek the employments. The jobs arrive one at a time in sequential order. Associated with the arriving job is a i.i d. ramdom variable with lhe c.d.f. F(x). At this point these men decide to be engaged in this job or to continue the search for the jobs. After having been employed for one period, the employed man is fired with probability p and permanently employed with probability I-p. We assume that these n men have the abilities P1,,,.,Pn. We study these problem with infinite horizon, search cost c and discount factor β < 1. The problem is to assign these n men so as to maximize the total expected reward.