We consider the so-called secretary problem, in which an offer may be declined by each applicant with a fixed known probability q (= 1 - p, 0 ≤ g < 1) and the number of offering chances are at most m (≥ 1). The optimal strategy of this problem is derived and some asymptotic results are presented. Furthermore we briefly consider the case in which the acceptance probability depends on the number m of offering chances.
|ジャーナル||Journal of the Operations Research Society of Japan|
|出版ステータス||Published - 1996 1月 1|
ASJC Scopus subject areas
- 経営科学およびオペレーションズ リサーチ