Advanced Algorithms Matroid Secretary Problems
Advanced Algorithms Matroid Secretary Problems
复制标题
高级算法拟阵秘书问题
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Gautam Kamath
中科院分区：
文献类型：
--
作者：
Gautam Kamath
1963年，Dynkin提出了秘书问题b[6]。在这个问题中，给出了一个有n个正数值的算法。在每个值之后，算法必须接受或拒绝该值，其中所有决策都是最终的。算法只能选择一个值，目标是在序列中选择最大值。这个问题的名字来源于这样一个情况：有n个候选人参加了一个秘书职位的面试，面试官想要雇佣最好的候选人。这个问题的其他名称包括最佳选择问题、婚姻问题和麻省理工约会问题。
In 1963, Dynkin introduced the secretary problem [6]. In this problem, an algorithm is presented with n positive values, one by one. After each value, the algorithm must either accept or reject the value, where all decisions are final. The algorithm can only pick one value, and the goal is to pick the maximum value in the sequence. The name for this problem arises from a situation where n candidates are interviewed for a secretary position, and the interviewer wants to hire the best candidate. Other names for this problem include the best choice problem, the marriage problem, and the MIT dating problem.