| 引用本文: | 金治明,李晓杰.可招回秘书问题.[J].国防科技大学学报,1992,14(1):76-85.[点击复制] |
| Jin Zhiming,Li Xiaojie.A Secretary Problem with Backward Solicitation[J].Journal of National University of Defense Technology,1992,14(1):76-85[点击复制] |
|
| |
|
|
| 本文已被：浏览 5959次 下载 5620次 |
| 可招回秘书问题 |
| 金治明1, 李晓杰2 |
|
(1.系统工程与应用数学系;2.航天部14所)
|
| 摘要: |
| 可招回秘书问题已由Yang,Petrucceol，Choe及Bal研究过。本文将这个问题纳入 Snell 框架，用相对最好者的位置函数 Wn 代替通常的相对名次，我们得到了各种招回概率下的最优停止规则，这些结果推广了文[7]-[9]。 |
| 关键词: 概率，最优，停止规则，招回，秘书问题 |
| DOI： |
| 投稿日期：1991-04-17 |
| 基金项目: |
|
| A Secretary Problem with Backward Solicitation |
|
(1.Department of System Engineering and App1ied Mathematics)
|
| Abstract: |
| The secretary problem with backward solicitation has been studied by Yang，Joseph，Petrocceoi，Choe and Bal. The problem is put into snell frame，the relative rank yk is replaced by the relatively best position function. Optimal stopping rules are obtained with differential probability of backward solicitation. |
| Keywords: probability,optimal,stopping rule,backward solicitation,secretary problem |
|
|
|
|
|
