Finding Robust Solutions to Stable Marriage - Archive ouverte HAL
Communication Dans Un Congrès Année : 2017

Finding Robust Solutions to Stable Marriage

Résumé

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
Origine Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

Citer

Begum Genc, Mohamed Siala, Gilles Simonin, Barry O ' Sullivan. Finding Robust Solutions to Stable Marriage. IJCAI 2017, Aug 2017, Melbourne, Australia. ⟨10.24963/ijcai.2017/88⟩. ⟨hal-01689897⟩
214 Consultations
116 Téléchargements

Altmetric

Partager

More