• Well it turns out that a reasonable strategy is to find some fraction and perform the following algorithm. Observe the "spectrum" of applicants up to some predetermined fraction of the pool and then pick the next person who beats everyone that preceeded him/her. The question now is what is the fraction to observe that will maximize the probability that you select the best applicant.
  • Ofcourse this way it is possible that you never see the best or it is possible that you will already have passed the best and are doomed, but nonetheless this is the method to maximize the probability.
  • For the very interesting application to follow, all you need is the existence of this number. Assume that it can be calculated.

    The Dating Game

    You're young and waiting. How long should you wait?

    WARNING! Some people claim that they can identify their TRUE LOVE on the spot. BEWARE of such FOOLS!

    One must also take care to abide by The Magdon-Pregs Wild-Timid theorem.

    All this analysis decays when one reaches a point in one's life where one decides that the best is not necessarily the only acceptable solution. Sad as it is to say, perfect is not a practical word.