| 引用本文: | 金治明.允许拒绝的秘书问题.[J].国防科技大学学报,1986,(2):69-75.[点击复制] |
| Jin Zhiming.A Secretay Problem With Refusing[J].Journal of National University of Defense Technology,1986,(2):69-75[点击复制] |
|
| |
|
|
| 本文已被：浏览 5013次 下载 5299次 |
| 允许拒绝的秘书问题 |
| 金治明 |
|
()
|
| 摘要: |
| 本文考虑了一类特殊的秘书问题，每一名候选的姑娘都因某种理由以一定概率拒绝入选，而且假定这个拒绝概率只与候选人的绝对名次有关。本文给出了这一问题的最优停止规则，推广了文献[2]的结果。 |
| 关键词: |
| DOI： |
| 投稿日期：1985-09-03 |
| 基金项目: |
|
| A Secretay Problem With Refusing |
| Jin Zhiming |
| Abstract: |
| In this paper，we comsider a class of special secretary problem. Every applicant can refuse an offier of employment with a probability which depend only on her absolute rank. We derive the optimal stopping rule which maximizes the probabitily of employing the best one. |
| Keywords: |
|
|
