TY - JOUR

T1 - A secretary problem with uncertain employment when the number of offers is restricted

AU - Ano, Katsunori

AU - Tamaki, Mitsushi

AU - Hu, Mu Ci

PY - 1996/1/1

Y1 - 1996/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0004764960&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0004764960&partnerID=8YFLogxK

U2 - 10.15807/jorsj.39.307

DO - 10.15807/jorsj.39.307

M3 - Article

AN - SCOPUS:0004764960

VL - 39

SP - 307

EP - 315

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

SN - 0453-4514

IS - 3

ER -