Let me briefly recall the problem and its solution: suppose you have n candidates, from which you want to pick the best one. This is less romantically known as the secretary problem. 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).
0 Comments
Leave a Reply. |