Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2018:journals:bowmang:chapter1 [2018/01/17 04:43] – bowmang | courses:cs211:winter2018:journals:bowmang:chapter1 [2018/01/17 04:43] (current) – bowmang | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== Chapter 1.1 (Stable Matching) ====== | ====== Chapter 1.1 (Stable Matching) ====== | ||
| - | * Summary of the section | + | * Summary of the section |
| * When you have two groups of entities with ranked preferences for who they want to be matched with in the other group you should use a stable matching algorithm. In doing so, you will guarantee the best match possible for all entities in which no two entities would prefer to be matched together over their current match (ie. stable match). This is an extremely useful solution for things like applying to jobs or school as the person applying and the institution screening both know that the match fits and that there won't be any chaos if the person is accepted to a different place or if the place would rather choose a different applicant over them. | * When you have two groups of entities with ranked preferences for who they want to be matched with in the other group you should use a stable matching algorithm. In doing so, you will guarantee the best match possible for all entities in which no two entities would prefer to be matched together over their current match (ie. stable match). This is an extremely useful solution for things like applying to jobs or school as the person applying and the institution screening both know that the match fits and that there won't be any chaos if the person is accepted to a different place or if the place would rather choose a different applicant over them. | ||
| * Motivations for the problem | * Motivations for the problem | ||
