There are an equal number of eligible women and men in a village. They have their preferences. The village elders wish to match them up in such a way that no woman and man are tempted to leave the suggested match and instead join each other. In 1962, economists and mathematicians Gale and Shapley proposed an amazing algorithm to find a stable match. We will run this algorithm and observe a striking phenomenon that was only recently analysed.
No prior experience with computer science, economics, mathematics or marriage will be necessary to follow the talk.
