Wedding Algorithm

R Bucao — Wed, 17 Jun 2009 01:50:05 +0000

It’s just another one of those tests at Facebook but it’s interesting how they arrived at the result. I’m guessing there are inverse variations with age or nuptials you’ve attended (i.e. the higher it is, the shorter the time until you get married) but the others are not so clear-cut. For example, would falling in love the most number of times make you more probable to get married?

IMHO, the result is a proxy for determining when you would *decide* to get married and not the actual date but without the details of its function we won’t really be sure.

The Plus/Minus Seven Rule

R Bucao — Tue, 16 Jun 2009 02:13:28 +0000

This Telegraph post might explain why there’s a dating adage (at least in western countries) that men should date women who are approximately:

(age of man ÷ 2) + 7,

while women should go for men who are:

(age of woman x 2) – 7.

Younger women have a higher probability of being more beautiful than their elders while older men have a higher chance of having a more stable income than their younger counterparts.

Which, in retrospect, does not absolve you of being a cradle-snatcher (if you’re a man) or a gold digger (if you’re a woman).

Go figure.

Of Dating and Decision Theories

R Bucao — Fri, 12 Jun 2009 11:07:32 +0000

Imagine waiting in line to a scrumptious buffet table catering delicacies from all over the world – but that’s not what made it so special. It’s such an unusual buffet because you are given one hour to choose one dish, one meal from the table with which you could have for the rest of the evening. Of course, you’ll set out to pick the best of the lot but there’s a catch: in choosing you can only try only one meal at a time on your plate. To add to the challenge, not all meals will be available at all times; some dishes might fade away in only a few minutes, others might stay for an instant, staying to exist only when you choose it. Another thing, once you tasted a meal and decide to choose another, you may never get that same dish again.

What would be the best way to solve this problem? One might choose a dish which he is most familiar with then make it his pick. Another might continue trying every dish until the hour runs out. Still another might go for a dish if it is “two standard deviations in tastiness” from the first dish he had tasted. Whatever strategy a person chooses, this is one problem decision theorists call as one of sequential search and optimal stopping, or the ways with which we figure out the best choice given a string of options tried out in turn.

Of course at this point we’ve probably figured out that the “dating game” models the same quandary. It should have been easy if each succeeding date is better than the previous one because that means the more we spend time searching, the higher the probability we will get the “best one” in the end — but real life plays dice more often than not. We will never be too sure when we’re actually letting go of something special. How would we really know?

The only thing that I could think of right now is to try to commit and to choose more. We’d have to give it a try first before we can fully be sure what we really feel. If we are juggling so many options at one time (i.e. so many dates) then that means lesser time being spent on each one, lowering the chance of getting to know about each person better. Needless to say, we can’t place equal weight on each choice and give equal chances to all. To be able to enjoy an experience further, we have to limit our experience to that one option even only for a time.

The thing is, whether it’s about buffets or about love, how can we know if it will work if we don’t give it our all?

Dating Calculus

Wedding Algorithm

The Plus/Minus Seven Rule

Of Dating and Decision Theories