Content deleted Content added
downcased words, as per Wikipedia:Manual of Style#Headings |
→Solving the problem: Fixing some grammar so the paragraph makes sense |
||
Line 7:
In 1962, Gale and Shapley proved that, for any equal number of men and women, it is always possible to solve the SMP and make all marriages stable. They presented an [[algorithm]] to do so.
The Gale-Shapley algorithm involves a number of "rounds" (or "[[iteration]]s") where each unengaged man "proposes" to the most-preferred woman to whom he has not yet proposed, and she accepts or rejects him based on whether she is already engaged to someone she prefers. If she is unengaged, or engaged to a man lower down her preference list than her new suitor, she accepts the proposal (and in the latter case, the other man becomes unengaged again). Note that only women can switch partners to increase their happiness.
This algorithm guarantees that:
Line 13:
'''Everyone gets married:''' Once a woman becomes engaged, she is always engaged to someone. So, at the end, there cannot be a man and a woman both unengaged, as he must have proposed to her at some point (since a man will eventually propose to everyone, if necessary) and, being unengaged, she would have to have said yes.
'''The marriages are stable:'''
Proof ==Stable matching algorithm==
|