Stable matching problem
The problem of finding a matching with no blocking pair: two unmatched participants who would both prefer each other to their assigned partners.
The problem of finding a matching with no blocking pair: two unmatched participants who would both prefer each other to their assigned partners.