Stable Matchings in Divorce Graphs
share
In this paper, we study the Reaching Stable Marriage via Divorce Operations problem, which given a Stable Marriage instance and an initial matching, asks whether a stable matching for the instance is reachable by a sequence of divorce operations as introduced by Tamura [Journal of Combinatorial Theory, 1993]. We show that for incomplete preferences with ties, Reaching Stable Marriage via Divorce Operations is NP-complete.
READ FULL TEXT
