Announcement

**Kidlicious** · February 15, 2007, 16:41

I would think you would learn that in economics, not computer science.

**lord of the mark** · February 15, 2007, 16:45

In Comp sci, wouldnt "restore" family "values" mean something different?

Comment, X is Family
Initialize value of X, X=0
X= X+1
various stuff
Restore X to X=0

or something like that?

**Kuciwalker** · February 15, 2007, 16:46

No. It means returning to the traditional marriage algorithm (guys are suitors to girls, basically).

**lord of the mark** · February 15, 2007, 16:48

Re: we need to restore family values

Originally posted by Kuciwalker
Today in computer science we proved:

If we just returned to traditional marriages we'd eliminate adultery, and

If we legalize gay marriage we have to legalize polygamy too.

Marriage=traditional
Adultery=0
Call "change marriage'
Check value, Adultery
IF Adultery!=0, goto 100, else 200
100 Marriage = traditional
adultury=0
200=End

**Kuciwalker** · February 15, 2007, 16:50

Dude, marriage isn't a variable, and neither is adultery.

**lord of the mark** · February 15, 2007, 16:51

Originally posted by Kuciwalker
Dude, marriage isn't a variable,
.

Dude, you dont speak from experience.

**Kidlicious** · February 15, 2007, 16:52

**Barnabas** · February 15, 2007, 16:52

I agree with legalizing polygamy (if gay marriage is legal)

**Kidlicious** · February 15, 2007, 16:57

What about gay polygamy?

**Kuciwalker** · February 15, 2007, 16:59

Originally posted by lord of the mark
Dude, you dont speak from experience.

But I have a proof

For the second one*:

You have some population with an equal number of boys and girls. Each boy has an ordered list of girls from most attractive to least attractive.

A pairing on a population is a way of matching each boy with one girl and no girl with multiple boys.

A stable pairing is a pairing for which no guy finds a girl more attractive than his match who also find him more attractive than her match, e.g. b1 is match with g1 and b2 with g2 but b1 prefers g2 and g2 prefers b1.

The traditional marriage algorithm is a way of matching up boys and girls through the following: each boy visits the first girl on his list. Each girl picks the best of the boys that visited her and attaches him to a string. The rest get told "go away and never come back." These boys cross the first girl off their list. The next day, each boy with a string returns to the same girl, and each other boy goes to the next girl on his list. The girls repeat the process, attaching the string to a new boy if a better one comes along (releasing the old boy). This continues until no boy is rejected on a round.

The traditional marriage algorithm is guaranteed to produce a stable pairing and finish within a finite amount of time. The proof is left as an exercise to the reader.

*if it wasn't clear, this isn't supposed to be a proof, but an explanation

**Pekka** · February 15, 2007, 17:00

We should restore Droit de seigneur.

**Kuciwalker** · February 15, 2007, 17:01

Pekka you ought to know what I'm talking about.

**Pekka** · February 15, 2007, 17:04

I'm all for deflowering virgins. In fact, I'd prefer if the soon to be husband would have to watch it. And then, every friday night, the young couple would have to watch the video of that marathon session of deflowering by me.

**Kidlicious** · February 15, 2007, 17:07

You can't talk to him right now Kuciwalker