An Approach to Robustness in the Stable Roommates Problem and its Comparison with the Stable Marriage Problem

Abstract : Recently a robustness notion for matching problems based on the concept of a (a, b)-supermatch is proposed for the Stable Marriage problem (SM). In this paper we extend this notion to another matching problem, namely the Stable Roommates problem (SR). We define a polynomial-time procedure based on the concept of reduced rotation poset to verify if a stable matching is a (1, b)-supermatch. Then, we adapt a local search and a genetic local search procedure to find the (1, b)-supermatch that minimises b in a given SR instance. Finally, we compare the two models and also create different SM and SR instances to present empirical results on the robustness of these instances.
Complete list of metadatas

https://hal.laas.fr/hal-02062127
Contributor : Mohamed Siala <>
Submitted on : Friday, March 8, 2019 - 3:43:57 PM
Last modification on : Friday, June 14, 2019 - 6:31:23 PM
Long-term archiving on : Monday, June 10, 2019 - 3:52:39 PM

File

19-CPAIOR.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02062127, version 1

Citation

Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'sullivan. An Approach to Robustness in the Stable Roommates Problem and its Comparison with the Stable Marriage Problem. Sixteenth International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Jun 2019, THESSALONIKI, Greece. ⟨hal-02062127⟩

Share

Metrics

Record views

62

Files downloads

45