KnowraStable matchingLinked fromLinked fromThe 9 pages that link to Stable matching, each with the reason it gives.All 9Broader topic 2Related 3Narrower topic 2Compared with 2Lloyd ShapleyRelated: Stability is the central condition in the algorithm Shapley developed with Gale.Perfect matchingCompared with: Stability concerns preferences, not simply whether every vertex is covered.Stable marriage problemBroader topic: It is the required outcome, distinguished from merely complete or feasible matchings.Market designRelated: Stability prevents mutually beneficial defections from undermining a matching system.David GaleBroader topic: Stability is the defining condition the Gale–Shapley procedure guarantees.Gale–Shapley algorithmNarrower topic: The algorithm’s central guarantee is that its final matching is stable.Alvin E. RothRelated: Stability is a central criterion in the matching systems Roth studied and implemented.Hungarian algorithmCompared with: Stability depends on preferences, not the total edge cost minimized here.Stable roommates problemNarrower topic: The roommate problem is a stable-matching problem without a division into two sides.