An approach to robustness in the Stable Roommates problem and its comparison with the Stable Marriage problem
dc.contributor.author | Genc, Begum | |
dc.contributor.author | Siala, Mohamed | |
dc.contributor.author | Simonin, Gilles | |
dc.contributor.author | O'Sullivan, Barry | |
dc.contributor.funder | Science Foundation Ireland | en |
dc.contributor.funder | European Regional Development Fund | en |
dc.date.accessioned | 2019-05-29T10:42:38Z | |
dc.date.available | 2019-05-29T10:42:38Z | |
dc.date.issued | 2019 | |
dc.date.updated | 2019-03-27T10:47:04Z | |
dc.description.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. | en |
dc.description.status | Peer reviewed | en |
dc.description.version | Submitted Version | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.articleid | hal-02062127 | |
dc.identifier.citation | Genc, B., Siala, M., Simonin, G. and O’Sullivan, B. (2019) ‘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, Thessaloniki, Greece, 4-7 June, pp. 1-16. Available at: https://hal.laas.fr/hal-02062127 (Accessed: 29 May, 2019) | en |
dc.identifier.endpage | 16 | en |
dc.identifier.startpage | 1 | en |
dc.identifier.uri | https://hdl.handle.net/10468/7996 | |
dc.language.iso | en | en |
dc.publisher | HAL-LAAS Open Archive | en |
dc.relation.ispartof | CPAIOR 2019: Sixteenth International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research | |
dc.relation.project | info:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/ | en |
dc.relation.uri | https://hal.laas.fr/hal-02062127/document | |
dc.relation.uri | http://cpaior2019.uowm.gr/program/ | |
dc.relation.uri | https://hal.laas.fr/hal-02062127 | |
dc.rights | © 2019, the Authors. All rights reserved. | en |
dc.subject | Polynomial-time procedure | en |
dc.subject | Reduced rotation | en |
dc.subject | Stable matching | en |
dc.subject | Stable Marriage problem | en |
dc.subject | Stable Roommates problem | en |
dc.subject | Robustness | en |
dc.subject | Meta-heuristics | en |
dc.subject | Complexity | en |
dc.title | An approach to robustness in the Stable Roommates problem and its comparison with the Stable Marriage problem | en |
dc.type | Conference item | en |