Stable matching problem: Difference between revisions

Content deleted Content added
wording was confusing. changed match to pair, as the pair (A,B) as they are not yet matched.
Algorithmic solution: Fixed punctuation
Tags: Mobile edit Mobile web edit
Line 93:
 
Among all possible different stable matchings, it always yields the one that is best for all men among all stable matchings, and worst for all women.
It is a [[truthful mechanism]] from the point of view of men (the proposing side)., Ii.e., no man can get a better matching for himself by misrepresenting his preferences. Moreover, the GS algorithm is even ''group-strategy proof'' for men, i.e., no coalition of men can coordinate a misrepresentation of their preferences such that all men in the coalition are strictly better-off.<ref>{{cite journal
| last1 = Dubins | first1 = L. E. | author1-link = Lester Dubins
| last2 = Freedman | first2 = D. A. | author2-link = David A. Freedman