Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| courses:cs211:winter2018:journals:patelk:chapter1 [2018/01/10 03:44] – patelk | courses:cs211:winter2018:journals:patelk:chapter1 [2018/01/11 00:45] (current) – [1.1 A First Problem: Stable Matching] patelk | ||
|---|---|---|---|
| Line 3: | Line 3: | ||
| **Problem Explanation** | **Problem Explanation** | ||
| + | |||
| The Stable Matching Problem originated from two mathematical economists, David Gale and Lloyd Shapley, who wanted to understand if it was possible to design a job recruiting process that was // | The Stable Matching Problem originated from two mathematical economists, David Gale and Lloyd Shapley, who wanted to understand if it was possible to design a job recruiting process that was // | ||
| Line 43: | Line 44: | ||
| This chapter section was clear and concise in describing the Stable Matching Problem. It was well-explained and provided an interesting insight into one of the more basic algorithm problems. It is very easy to see where more complexity can be added into this problem, and serves as motivation for why this problem is explored first. It will be interesting to see cases where this problem is morphed (i.e- the example of the two sets of men and women not being completely separate). | This chapter section was clear and concise in describing the Stable Matching Problem. It was well-explained and provided an interesting insight into one of the more basic algorithm problems. It is very easy to see where more complexity can be added into this problem, and serves as motivation for why this problem is explored first. It will be interesting to see cases where this problem is morphed (i.e- the example of the two sets of men and women not being completely separate). | ||
| + | Readability: | ||
| + | Interesting: | ||
