Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 307-315 |
Number of pages | 9 |
Journal | Journal of the Operations Research Society of Japan |
Volume | 39 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1996 Jan 1 |
ASJC Scopus subject areas
- Decision Sciences(all)
- Management Science and Operations Research