Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2012:journals:jeanpaul:pagename [2012/01/14 21:30] – mugabej | courses:cs211:winter2012:journals:jeanpaul:pagename [2012/01/14 21:31] (current) – mugabej | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== | + | ======1.1 A First Problem: Stable Matching |
| - | * [[pagename|1.1 A First Problem: Stable Matching]] | + | |
| - | + | ||
| The Stable matching problem originated in 1962 when two mathematical economists David Gale and Lloyd Shapley asked if one could design a college admissions process,or job recruiting process that was self-enforcing. The goal would be to get a stable outcome where both applicants and recruiters would be happy.To solve the problem, Gale and Shapley simplified it to the problem of devising a system by which each n men and n women can end up getting married. In this case, two genders represent the applicants and the companies, and everyone is seeking to be paired with exactly one individual of the opposite gender. \\ | The Stable matching problem originated in 1962 when two mathematical economists David Gale and Lloyd Shapley asked if one could design a college admissions process,or job recruiting process that was self-enforcing. The goal would be to get a stable outcome where both applicants and recruiters would be happy.To solve the problem, Gale and Shapley simplified it to the problem of devising a system by which each n men and n women can end up getting married. In this case, two genders represent the applicants and the companies, and everyone is seeking to be paired with exactly one individual of the opposite gender. \\ | ||
| \\ | \\ | ||
