Finding Love with a Modified Drake’s Equation

Some time ago, I wrote an article on the optimal way to select a mate, assuming you know how many eligible partners exist, and that once you’ve dated someone, you can’t go back and date them again (sorry, Drew Barrymore and that dude from the Apple commercials). This is less romantically known as the secretary problem. Let me briefly recall the problem and its solution: suppose you have n candidates, from which you want to pick the best one. This applies to a variety of situations, from hiring a secretary to finding a girlfriend to apartment hunting. In either case, the outcome is the same: you should look at roughly the first n/e of them (yes, that e), and then select the first one after those n/e which is better than all that you have seen so far. While this strategy won’t guarantee you get the best choice, it . . . → Read More: Finding Love with a Modified Drake’s Equation

Pin It