A class of best-choice problems on sequences of continuous bivariate random variables
Minoru Sakaguchi, Toshio Hamada · Lecture notes-monograph series · 2000
An employer interviews a finite number n of applicants for a position.They are interviewed one by one sequentially in random order.As each applicant i is interviewed, two attributes are evaluated by the amounts Xi and Yί, where X^s and Yί's are n °t necessarily mutually independent, but {(Xi,Yi)}™=ι is ϋd sequence of continuous bivariate random variables and the common distribution of (Xi,Yί)'s is known.Suppose that the employer is under the condition of full-information secretary problem without recall.We consider two kinds of the employer's objective and for each of the objectives the problems are formulated by dynamic programming and the optimal policy is explicitly derived.