Say in my lifetime I can date a maximum of about 100 girls and my goal is to find the best one to marry. Obviously dating each costs resources (time,money) so I don't necessary want to spend resources to date all 100 of them to find out.
What is my best mathematical strategy for finding the best girl while using the least resources to do so?
When should I stop dating? Do I stop at girl#35 b/c she's the best so far and I don't want to risk losing my shot at the best by searching on for the best ironically.
So for simplicity lets say the chance to date a girl you previously dated is 0. So it is a one way search.
Also, lets say that I want to be 95% confident that the girl I should stop at is the best one out of the 100 possible.
Big props to whoever can find an answer to this, especially if it is a generalized formula for the variables:
SS - Sample Size: 100 in this example
CL - Confidence Level : 95% in this example
MD - chance for Multiple Dates with previously dated girl. This example: 0 for all for simplicity.
C - Cost of resources: make up an easy # for this example. BIG props if you can factor in a cost variable into the formula. Cost is a variable since it affects how many dates you want to try. Maybe it can be simplified since the higher the cost the easier it is to accept a low confidence and Cost can just be a simple sub-variable of the Confidence Level wanted and won't affect the structure of the overall formula. But also this Cost variable will be related to MD above.