The Mathematics of Love--GEMS program

12/14/2013 - 10:00am
12/14/2013 - 12:00pm

Marina Chugunova, CGU, will present:

The Mathematics of Love
In mathematics the stable marriage problem is the problem of finding a stable matching between two sets of elements given a set of preferences for each element. It is commonly stated as:
Given n men and n women, where each person has ranked all members of the opposite sex with a unique number between 1 and n in order of preference, marry the men and women together such that there are no two people of opposite sex who would both rather have each other than their current partners. If there are no such people, all the marriages are "stable".
Algorithms for finding solutions to the stable marriage problem have various applications in the real life, perhaps the best known of these being in the assignment of graduating medical students to their first hospital appointments.
We will suppose the general rules governing marriage are these: Any man and woman who both consent to marry one another may proceed to do so, and any man or woman is free to withhold his or her consent and remain single.
We will consider more detailed descriptions of possible rules at various points in the discussion. During the practice session high school students will develop skills of finding the stable matching in different real-world situations.
 
 

AttachmentSize
GEMSFlyerFall2013-NEW.pdf1.58 MB

Claremont Graduate University | Claremont McKenna | Harvey Mudd | Pitzer | Pomona | Scripps
Proudly Serving Math Community at the Claremont Colleges Since 2007
Copyright © 2018 Claremont Center for the Mathematical Sciences