Unknown Number of Applicants
A major drawback for applications of the solution of the classical secretary problem is that the number of applicants must be known in advance. One way to overcome this problem is to suppose that the number of applicants is a random variable with a known distribution of (Presman and Sonin, 1972). For this model, the optimal solution is in general much harder, however. Moreover, the optimal success probability is now no longer around 1/e. Indeed, it is intuitive that there should be a price to pay for not knowing the number of applicants. However, in this model the price is high. Depending on the choice of the distribution of the optimal win probability is typically much lower than 1/e, and may even approach zero. Looking for ways to cope with this new problem led to the following approach and result:
Read more about this topic: Secretary Problem
Famous quotes containing the words unknown and/or number:
“Pray you bid
These unknown friends to’s welcome, for it is
A way to make us better friends, more known.”
—William Shakespeare (1564–1616)
“I will not adopt that ungenerous and impolitic custom so common with novel writers, of degrading by their contemptuous censure the very performances, to the number of which they are themselves adding—joining with their greatest enemies in bestowing the harshest epithets on such works, and scarcely ever permitting them to be read by their own heroine, who, if she accidentally take up a novel, is sure to turn over its insipid leaves with disgust.”
—Jane Austen (1775–1817)