Revision as of 19:17, 21 September 2006 edit 192.75.48.150 (talk) Observations ← Previous edit		Revision as of 20:17, 15 October 2006 edit undo Henning Makholm (talk \| contribs) Extended confirmed users, Rollbackers 7,454 edits Solutions for constrained problems Next edit →
Line 14: I removed this section. I doubt that it is even true that it is quite likely you will get someone high on your preference list (what are the chances that you were high on their preference list?), let alone the stuff about beauty and happiness. [[User:192.75.48.150\|192.75.48.150]] 19:17, 21 September 2006 (UTC) == Solutions for constrained problems == Anybody know if there are computationally feasible algorithms for solving marriage problems with constraints, e.g. "Is there any stable pairing that matches Alice with Bob and Claire with Dave?" [[User:Henning Makholm\|Henning Makholm]] 20:17, 15 October 2006 (UTC)

Talk:Stable matching problem: Difference between revisions