I remember a story about a famous mathematician who was offered ten marriage candidates and had to pick one of them, with the condition he had to meet them in turn and propose during that meeting, with no changing his mind to an earlier one. If he went through all ten without proposing then it was too bad for him.
This caused him to develop a mathematical formula to maximise the odds of knowing when he met the best one based on how many times he met a 'best candidate so far', and he proposed to the seventh (I think).
Could someone remind me who he was?