New dating is a search problem
New dating is a search problem - miley cirus dating nick jonas
In the scenario, you’re choosing from a set number of options.For example, let’s say there is a total of 11 potential mates who you could seriously date and settle down with in your lifetime.
This can be a serious dilemma, especially for people with perfectionist tendencies.
You want to date enough people to get a sense of your options, but you don't want to leave the choice too long and risk missing your ideal match.
You need some kind of formula that balances the risk of stopping too soon against the risk of stopping too late.
And as you continue to date other people, no one will ever measure up to your first love, and you’ll end up rejecting everyone, and end up alone with your cats.
(Of course, some people may find cats preferable to boyfriends or girlfriends anyway.) Another, probably more realistic, option is that you start your life with a string of really terrible boyfriends or girlfriends that give you super low expectations about the potential suitors out there, as in the illustration below.
But it turns out that there is a pretty simple mathematical rule that tells you how long you ought to search, and when you should stop searching and settle down.
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 .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 choose that person, you win the game every time -- he or she is the best match that you could potentially have.If you increase the number to two suitors, there's now a chance of picking the best suitor.The diagram below compares your success rate for selecting randomly among three suitors.