On the complexity of Robust Stable Marriage

Thumbnail Image
4581.pdf(108.68 KB)
Accepted version
Genc, Begum
Siala, Mohamed
Simonin, Gilles
O'Sullivan, Barry
Journal Title
Journal ISSN
Volume Title
Springer International Publishing
Research Projects
Organizational Units
Journal Issue
Robust Stable Marriage (RSM) is a variant of the classical Stable Marriage problem, where the robustness of a given stable matching is measured by the number of modifications required for repairing it in case an unforeseen event occurs. We focus on the complexity of finding an (a, b)-supermatch. An (a, b)-supermatch is defined as a stable matching in which if any a (non-fixed) men/women break up it is possible to find another stable matching by changing the partners of those a men/women and also the partners of at most b other couples. In order to show deciding if there exists an (a, b)-supermatch is NPNP -complete, we first introduce a SAT formulation that is NPNP -complete by using Schaefer’s Dichotomy Theorem. Then, we show the equivalence between the SAT formulation and finding a (1, 1)-supermatch on a specific family of instances.
Robust Stable Marriage (RSM) , Stable Marriage problem , Combinatorial optimization , A-stable , Classical stable marriages , Dichotomy theorem , NP Complete , Stable marriages , Stable matching
Genc, B., Siala, M., Simonin, G. and O’Sullivan, B. (2017) 'On the Complexity of Robust Stable Marriage', in Gao, X., Du, H. & Han, M. (eds.) Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II, Lecture Notes in Computer Science, LCNS vol. 10335, Cham: Springer International Publishing, pp. 441-448. doi: 10.1007/978-3-319-71147-8_30
Link to publisher’s version
© Springer International Publishing AG 2017. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-71147-8_30