Linked from

The 12 pages that link to Stable marriage problem, each with the reason it gives.

• Bipartite graphRelated: Its possible pairings form a bipartite graph between two participant groups.

• Matching (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.

• Perfect matchingRelated: Its pairings are perfect matchings, though stability adds a preference constraint.

• Stable matchingBroader topic: It is the best-known formulation that made the stable-matching idea precise.

• David GaleBroader topic: Gale and Shapley used this model to formulate their matching result.

• Gale–Shapley algorithmNarrower topic: Gale and Shapley formulated the algorithm to solve this problem.

• 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.