Robust Stable Marriage - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Robust Stable Marriage

Résumé

Stable Marriage (SM) is a well-known matching problem, where the aim is to match a set of men and women. The resulting matching must satisfy two properties: there is no unassigned person and there are no other assignments where two people of opposite gender prefer each other to their current assignments. We propose a new version of SM called as Robust Stable Marriage (RSM) by combining stability and robustness. We define robustness by introducing (a,b)-supermatches, which has been inspired by (a, b)-supermodels (Ginsberg, Parkes, and Roy 1998). An (a, b)-supermatch is a stable matching, where if at most a pairs want to break up, it is possible to find another stable matching by breaking at most b other pairs.
Fichier principal
Vignette du fichier
14785-66655-1-PB-2.pdf (594.17 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01689852 , version 1 (10-04-2018)

Identifiants

  • HAL Id : hal-01689852 , version 1

Citer

Begum Genc, Mohamed Siala, Barry O ' Sullivan, Gilles Simonin. Robust Stable Marriage. AAAI - 17, Feb 2017, San Francisco, United States. pp.4925-4926. ⟨hal-01689852⟩
91 Consultations
38 Téléchargements

Partager

Gmail Facebook X LinkedIn More