Differences
This shows you the differences between two versions of the page.
| courses:cs211:winter2018:journals:goldm:ch1.1 [2018/01/17 00:32] – created goldm | courses:cs211:winter2018:journals:goldm:ch1.1 [2018/01/19 03:57] (current) – admin | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | ====== Chapter 1 ====== | ||
| + | |||
| This section focuses on the algorithm developed by David Gale and Lloyd Shapley in 1962. The algorithm, called the Stable matching problem, is meant to answer the question: “Could one design a college admissions process, or a job recruiting process, that was self-enforcing? | This section focuses on the algorithm developed by David Gale and Lloyd Shapley in 1962. The algorithm, called the Stable matching problem, is meant to answer the question: “Could one design a college admissions process, or a job recruiting process, that was self-enforcing? | ||
