We find optimal stopping rules by using the weak infinitesimal generator of markov process.
利用弱无穷小算子，我们找出了最优停时规则。
In partioular, the optimal stopping rules of maximizing the probability of employing the best applicant and minimizing expected rank are derived respectively.
作为特例，分别得到了使选中最好的姑娘的概率最大和使选中的姑娘的绝对名次的数学期望最小的最优停止规则。
应用推荐