one of the hilarious things happened in my cs70 class yesterday. we were learning about stable pairings and to show this, our lecturer had this little demonstration. he asked for volunteers and 6 guys went up. well, the game goes like this. there are 4 guys and 4 girls and they want to find the configuration which will give them the most stable pairing of all. the thing was they needed to list their preference from 1 – 4 of the other group. The 2 groups were {boy 1, 2, 3, 4} and {girl 1, 2, 3, 4} and the lecturer even asked why several ppl chose that configuration. one said, i’d definitely not chose 3 cause he looks weak. REMEMBER, this was 6 guys in the front. it was hilarious, after they had their preference on who they wanted to marry (both boys and girls who were acted by guys had their preferences). so round 1 came, the setting was set in the medieval ages where boys would come to the girls tower and kneel down and propose). this is how it works, if the boy proposing is higher on her preference list than the one she already has, she kicks the previous one away and accepts the new one. If not, she just rejects him. So the guy goes through all of his entire list of preference until he finds a stable pairing. our job was to prove that given n boys and n girls, that there will always be a stable pairing. and sure enough, there will always be one.
good news guys. i’ve updated both the picture of the week and added a ton of new doodles. enjoy ^_^x