KnowraStable marriage problemLinked fromLinked fromThe 12 pages that link to Stable marriage problem, each with the reason it gives.All 12Broader topic 2Related 2Narrower topic 1Compared with 7Matching (graph theory)Compared with: It imposes preference-based stability, unlike ordinary matching's endpoint constraint.Assignment problemCompared with: Unlike minimum-cost assignment, it prioritizes preference stability rather than total cost.Bipartite matchingCompared with: It adds preference stability, a condition distinct from maximizing the number of pairs.Hall's marriage theoremCompared with: Stability concerns preference incentives, unlike Hall's feasibility condition for distinct choices.Hungarian algorithmCompared with: Unlike cost-minimizing assignment, this problem optimizes preference stability.Maximum-cardinality matchingCompared with: It optimizes stability under preferences rather than simply maximizing edge count.Stable roommates problemCompared with: Unlike the roommate problem, its two-sided structure guarantees a stable matching for complete preferences.