秘书问题是典型而又有趣的一类最优停止问题。本文用全概率公式给出秘书问题的一种初等解法。
The secretary problem is a very typical and interested optimal stop problem. In this paper we give a primary solution about secretary problem by formula of total probability.
它属于概率论与最优化理论的一个交叉研究领域，是最优停止理论中的一个著名问题。
As a famous problem of optimal stopping theory, it constitutes a field of study within probability-optimization.
本文主要讨论秘书问题的变形——“组面试问题”在目标是选择最优或次优时的最佳选择策略（停止规则），采用的主要方法是后退归纳法和边界阶段方法。
This article deals with a natural variation of the classical secretary problem called the group interview problem, in which each group contains several alternatives and each group of alternatives .
应用推荐