Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| courses:cs211:winter2018:journals:donohuem:chapter1 [2018/01/16 19:40] – donohuem | courses:cs211:winter2018:journals:donohuem:chapter1 [2018/01/19 03:48] (current) – admin | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ===== Chapter 1.1 ===== | + | ====== Chapter |
| + | ===== Section | ||
| Section 1.1 begins with an introduction of the **Stable Matching Problem**. The motivation behind this problem is to create a **self-enforcing** matching process, where the self interests of two given parties prevent matched pairs from being retracted and redirected. The authors explain this problem through the context of applicants seeking summer internships with certain employers. Given E employers and A applicants, as well as a list of preferences for each party, the goal of the problems is that either: | Section 1.1 begins with an introduction of the **Stable Matching Problem**. The motivation behind this problem is to create a **self-enforcing** matching process, where the self interests of two given parties prevent matched pairs from being retracted and redirected. The authors explain this problem through the context of applicants seeking summer internships with certain employers. Given E employers and A applicants, as well as a list of preferences for each party, the goal of the problems is that either: | ||
| * E prefers every one of its accepted applicants A; or | * E prefers every one of its accepted applicants A; or | ||
| Line 16: | Line 18: | ||
| w rejects m | w rejects m | ||
| - | Some observations of this algorithm are that womans' | + | Some observations of this algorithm are that womans' |
