Dating man married stop
One problem is the suitors arrive in a random order, and you don’t know how your current suitor compares to those who will arrive in the future. (If you're into math, it’s actually 1/e, which comes out to 0.368, or 36.8 percent.) Then you follow a simple rule: You pick the next person who is better than anyone you’ve ever dated before.
To apply this to real life, you’d have to know how many suitors you could potentially have or want to have — which is impossible to know for sure.
If you don't use our strategy, your chance of selecting the best is still 50 percent.
But as the number of suitors gets larger, you start to see how following the rule above really helps your chances.
You'd also have to decide who qualifies as a potential suitor, and who is just a fling.
The answers to these questions aren't clear, so you just have to estimate.
The math problem is known by a lot of names – “the secretary problem,” “the fussy suitor problem,” “the sultan’s dowry problem” and “the optimal stopping problem.” Its answer is attributed to a handful of mathematicians but was popularized in 1960, when math enthusiast Martin Gardner wrote about it in .The logic is easier to see if you walk through smaller examples.Let's say you would only have one suitor in your entire life.Settle down early, and you might forgo the chance of a more perfect match later on.Wait too long to commit, and all the good ones might be gone.
If you could only see them all together at the same time, you’d have no problem picking out the best. And as with most casino games, there’s a strong element of chance, but you can also understand and improve your probability of "winning" the best partner.