Revision as of 01:24, 20 May 2024 edit Volunteer Marek (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 94,409 edits →Algorithmic solution ← Previous edit		Revision as of 01:25, 20 May 2024 edit undo Volunteer Marek (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 94,409 edits →Rural hospitals theorem Next edit →
Line 123: == Rural hospitals theorem == {{main\|Rural hospitals theorem}} The [[rural hospitals theorem]] concerns a more general variant of the stable matching problem, like that applying in the problem of matching doctors to positions at hospitals, differing in the following ways from the basic {{mvar\|n}}-to-{{mvar\|n}} form of the stable marriage problem: Each participant may only be willing to be matched to a subset of the participants on the other side of the matching. The participants on one side of the matching (the hospitals) may have a numerical capacity, specifying the number of doctors they are willing to hire.

Stable matching problem: Difference between revisions