Stable Matching Problem

Concept

A problem about matching two sets of elements (e.g., boys and girls) with preferences for each other, ensuring no two unmatched elements would prefer each other to their current partners; a stable matching always exists and can be efficiently computed.

Mentioned in 1 video

Videos Mentioning Stable Matching Problem

Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111

Richard Karp: Algorithms and Computational Complexity | Lex Fridman Podcast #111

Lex Fridman

A problem about matching two sets of elements (e.g., boys and girls) with preferences for each other, ensuring no two unmatched elements would prefer each other to their current partners; a stable matching always exists and can be efficiently computed.