This utility will tell you the optimal number of candidates to interview given the total pool of applicants.
Wikipedia decribes the Secretary problem as thus:
The secretary problem is an optimal stopping problem that has been studied extensively in the fields of applied probability, statistics, and decision theory. It is also known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, and the best choice problem. The problem can be stated as follows:
Let us say that an applicant is a candidate only if it is better than all the applicants viewed previously. Clearly, since the objective in the problem is to select the single best applicant, only candidates will be considered for acceptance. One reason why the secretary problem has received so much attention is that the optimal policy for the problem (the stopping rule) has a surprising feature. Specifically, for large n the optimal policy is to skip the first n / e applicants and then to accept the next encountered candidate, where e is the base of the natural logarithm. As n gets larger, the probability of selecting the best applicant from the pool goes to 1 / e, which is around 37%. Whether one is searching through 100 or 100,000,000 applicants, the optimal policy will select the single best one about 37% of the time.
Notes
Selecting "Want Higher Value Applicant - Not best" uses this concept. The answer will always be sqrt(number or applicants) but I'll go ahead and calculate it for you anyway.
Utility Mill is another wonderful Blended Technologies project.
copyright, owned and operated by Blended Technologies LLC.