Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision |
| courses:cs211:winter2018:journals:shermanc:chapter1 [2018/01/16 07:19] – [1.1: A First Problem: Stable Matching] shermanc | courses:cs211:winter2018:journals:shermanc:chapter1 [2018/01/23 00:51] (current) – shermanc |
|---|
| ====== Chapter 1: Introduction: Some Representative Problems ====== | ====== Chapter 1: Introduction: Some Representative Problems ====== |
| | |
| |
| ===== 1.1: A First Problem: Stable Matching ===== | ===== 1.1: A First Problem: Stable Matching ===== |
| |
| This section had to do with the Stable Matching problem which we had already discussed in class. It was interesting to me that this algorithm had actually already been in use before Shapley's formal definition of it. Also, I liked how it clarified that there can be instances where there are more than one stable matches and also how the side that does the proposing, no matter what the context, is going to have the best possible matches. Lastly, it was important to note that no matter what the objects are that are being used in the algorithm, all executions will yield the same output. | This section had to do with the Stable Matching problem which we had already discussed in class. It was interesting to me that this algorithm had actually already been in use by hospitals in picking residents before Shapley's formal definition of it. Also, I liked how it clarified that there can be instances where there are more than one stable matches and also how the side that does the proposing, no matter what the context, is going to have the best possible matches. Lastly, it was important to note that no matter what the objects are that are being used in the algorithm, all executions will yield the same output. |
| |
| |
