Differences

This shows you the differences between two versions of the page.

--- courses:cs211:winter2018:journals:thetfordt:chapter1 [2018/01/14 18:33] – created thetfordt
+++ courses:cs211:winter2018:journals:thetfordt:chapter1 [2018/01/16 19:02] (current) – thetfordt
@@ Line 3: / Line 3: @@
 ===== 1.1: A First Problem: Stable Matching =====
-The section begins by walking through the context/problem which inspired the creation of the Stable Matching problem; two mathematical economists asked whether or not someone could design a college admissions/job recruitment process which was self-enforcing. I liked that the section began comparing the algorithm to a summer internship application process, this made the section directly relatable.
+The section begins by walking through the context/problem which inspired the creation of the Stable Matching problem; two mathematical economists asked whether or not someone could design a college admissions/job recruitment process which was self-enforcing. I liked that the section began comparing the algorithm to a summer internship application process, as this made the section directly relatable.
 The author then goes on to describe the problem in detail, outlining exactly what a stable matching is and why it makes sense to strive for stability. The goal is to obtain a final outcome between two parties where any two such parties could abandon the outcome in a mutual rebellion. The general intuition behind the algorithm is letting one party (here, a man) select another (woman). If the woman is single, they get together. If not, then the woman will examine her preferences, and leave her current man if the proposing man ranks higher than her current partner. But if this is also not the case, the man proposing will be rejected, and the algorithm will continue. With //n// men and //n// women, there can be at most //n^2// iterations.