Revision as of 17:48, 26 September 2006 edit Michael Hardy (talk \| contribs) Administrators 210,592 edits →Solution: link to David Gale ← Previous edit		Revision as of 17:49, 26 September 2006 edit undo Michael Hardy (talk \| contribs) Administrators 210,592 edits →Further reading: Corrected the name of the first journal and linked to Wikipedia's article about it. Changed the section title to "References". Next edit →
Line 47: The [[weighted matching problem]] is to find a matching in a weighted [[bipartite graph]] that has maximum weight. Maximum weighted matchings do not have to be stable, but in some applications a maximum weighted matching is better than a stable one. ==~~Further reading~~Reeferneces== * D. Gale, and L. S. Shapley: ''"College Admissions and the Stability of Marriage", ''~~, in~~ [[American ~~Mathematics~~Mathematical Monthly]] 69, 9-14, 1962. * Harry Mairson: '':The Stable Marriage Problem", ''~~, in~~ The Brandeis Review'' 12, 1992 ([http://www1.cs.columbia.edu/~evs/intro/stable/writeup.html online]). [[Category:Combinatorics]] [[zh:穩定婚姻問題]]

Stable matching problem: Difference between revisions