Recognizing the maximum of a random sequence based on relative rank with backward solicitation-Reference-Cited by-同舟云学术

Recognizing the maximum of a random sequence based on relative rank with backward solicitation

Published:1974-09 Issue:03 Volume:11 Page:504-512
ISSN:0021-9002
Container-title:Journal of Applied Probability
language:en
Short-container-title:J. Appl. Probab.

Author:

Yang Mark C. K.

Abstract

The classical secretary problem is generalized to admit stochastically successful procurement of previous interviewees, but each has a certain probability of refusing the offer. A general formula for solving this problem is obtained. Two special cases: constant probability of refusing and geometric probability of refusing are discussed in detail. The optimal stopping rules in these two cases turn out to be simple.

Publisher

Cambridge University Press (CUP)

Subject

Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability

Reference5 articles.

1. Differential Equations and Optimal Choice Problems

2. Dynamic Programming and Decision Theory

3. Optimal selection based on relative rank (the “secretary problem”)

4. Recognizing the Maximum of a Sequence

5. The Problem of Choice and the Sptimal Stopping Rule for a Sequence of Independent Trials

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object;Journal of Applied Probability;2006-03

2. Consumer Search: Not Enough or Too Much?;SSRN Electronic Journal;2001

3. Optimal stopping behavior with relative ranks: the secretary problem with unknown population size;Journal of Behavioral Decision Making;2000

4. Optimal selection based on relative ranks of a sequence by ties;Advances in Applied Probability;1984-03

5. Best-choice problems involving recall and uncertainty of selection when the number of observations is random;Advances in Applied Probability;1984-03