Finding Robust Solutions to Stable Marriage - Archive ouverte HAL Access content directly
Conference Papers Year :

Finding Robust Solutions to Stable Marriage


We study the notion of robustness in stable matching problems. We first define robustness by introducing (a, b)-supermatches. An (a, b)-supermatch is a stable matching in which if a pairs break up it is possible to find another stable matching by changing the partners of those a pairs and at most b other pairs. In this context, we define the most robust stable matching as a (1, b)-supermatch where b is minimum. We show that checking whether a given stable matching is a (1, b)-supermatch can be done in polynomial time. Next, we use this procedure to design a constraint programming model, a local search approach, and a genetic algorithm to find the most robust stable matching. Our empirical evaluation on large instances show that local search out-performs the other approaches.
Fichier principal
Vignette du fichier
0088.pdf (202.83 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01689897 , version 1 (22-01-2018)


  • HAL Id : hal-01689897 , version 1


Begum Genc, Mohamed Siala, Gilles Simonin, Barry O ' Sullivan. Finding Robust Solutions to Stable Marriage. IJCAI 2017, Aug 2017, Melbourne, Australia. ⟨hal-01689897⟩
202 View
95 Download


Gmail Facebook Twitter LinkedIn More