引用本文: | 车著明,金治明.第 K 次选择问题[J].国防科技大学学报,1995,17(4):143-147.[点击复制] |
Che Zhuming,Jin Zhiming.K_Th Choice Problem[J].Journal of National University of Defense Technology,1995,17(4):143-147[点击复制] |
|
|
|
本文已被:浏览 5196次 下载 971次 |
第 K 次选择问题 |
车著明1, 金治明2 |
(1.西昌卫星发射中心;2.国防科技大学)
|
摘要: |
从最优停止理论的经典问题——秘书问题出发,构想了 K 个经理从 N 个姑娘中各选一秘书的问题,证明了其最优规则,得出了概率最优值是参数为 K 的泊松分布的第K 项,即 e-kkk/k!,从侧面印证了第一标准秘书问题。 |
关键词: 概率 最优 停止规则 秘书问题 |
DOI: |
投稿日期:1994-12-10 |
基金项目:国家自然科学基金资助课题 |
|
K_Th Choice Problem |
Che Zhuming1, Jin Zhiming2 |
(1.Xichang Satellite Launching Center;2.National University of Defense Technology)
|
Abstract: |
Base on the classical problem of the theory of optimal stopping--the secretary problem,k-th choice problem is worked out (k managers choose k secretaries). The optimal stopping rule is given,and we proved that the optimal value of probability is the k-th item of Poisson distribution with parameter k, i. e. e-kkk/k!. It confirms the classical secretary problem with first criterion on the other hand. |
Keywords: optimal stopping rule,chioce problem |
|
|