%0 Journal Article %1 yang1974 %A Yang, Mark C. K. %D 1974 %I Applied Probability Trust %J Journal of Applied Probability %K %N 3 %P 504--512 %T Recognizing the Maximum of a Random Sequence Based on Relative Rank with Backward Solicitation %U http://www.jstor.org/stable/3212694 %V 11 %X 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.

@article{yang1974, 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.}, added-at = {2010-01-14T13:36:45.000+0100}, author = {Yang, Mark C. K.}, biburl = {https://www.bibsonomy.org/bibtex/294e7a5cc089982910d2038f0b3b684dc/enterldestodes}, copyright = {Copyright © 1974 Applied Probability Trust}, file = {:source/yang_recognizing_the_maximum_of_.pdf:PDF}, interhash = {f094a3392023a203157e55f7e8cdb7da}, intrahash = {94e7a5cc089982910d2038f0b3b684dc}, issn = {00219002}, journal = {Journal of Applied Probability}, jstor_articletype = {primary_article}, jstor_formatteddate = {Sep., 1974}, keywords = {}, number = 3, pages = {504--512}, publisher = {Applied Probability Trust}, timestamp = {2010-01-14T13:36:45.000+0100}, title = {Recognizing the Maximum of a Random Sequence Based on Relative Rank with Backward Solicitation}, url = {http://www.jstor.org/stable/3212694}, volume = 11, year = 1974 }