Revision as of 09:53, 25 April 2016 (view source) rosettacode>Gerard Schildberger m (added whitespace before the TOC (table of contents), added other whitespace before task preamble headers.) ← Older edit		Revision as of 10:29, 5 May 2016 (view source) Peter (talk \| contribs) m (changed women->woman) Newer edit →
Line 4: '''Problem description'''<br> Given an equal number of men and women to be paired for marriage, each man ranks all the women in order of his preference and each ~~women~~woman ranks all the men in order of her preference. A stable set of engagements for marriage is one where no man prefers a ~~women~~woman over the one he is engaged to, where that other woman ''also'' prefers that man over the one she is engaged to. I.e. with consulting marriages, there would be no reason for the engagements between the people to change. Gale and Shapley proved that there is a stable set of engagements for any set of preferences and the first link above gives their algorithm for finding a set of stable engagements.

Stable marriage problem: Difference between revisions

Stable marriage problem (view source)