### 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 |

Publication status | Published - 1996 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Decision Sciences(all)
- Management Science and Operations Research

### Cite this

*Journal of the Operations Research Society of Japan*,

*39*(3), 307-315.

**A secretary problem with uncertain employment when the number of offers is restricted.** / Ano, Katsunori; Tamaki, Mitsushi; Hu, MuCi.

Research output: Contribution to journal › Article

*Journal of the Operations Research Society of Japan*, vol. 39, no. 3, pp. 307-315.

}

TY - JOUR

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

AU - Ano, Katsunori

AU - Tamaki, Mitsushi

AU - Hu, MuCi

PY - 1996

Y1 - 1996

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

M3 - Article

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 -