{"type":"ScholarlyArticle","title":"Finding Robust Solutions to Stable Marriage","authors":[{"name":"Begum Genc","slug":"begum-genc","given":"Begum","family":"Genc","affiliation":""},{"name":"Mohamed Siala","slug":"mohamed-siala","given":"Mohamed","family":"Siala","affiliation":""},{"name":"Barry O'Sullivan","slug":"barry-o-sullivan","given":"Barry","family":"O'Sullivan","affiliation":""},{"name":"Gilles Simonin","slug":"gilles-simonin","given":"Gilles","family":"Simonin","affiliation":""}],"abstract":"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 outperforms the other approaches.","doi":"10.24963/ijcai.2017/88","url":"https://ijcai.org/proceedings/2017/88","pdf":"https://ijcai.org/proceedings/2017/0088.pdf","markdown":"https://ijcai.org/proceedings/2017/88.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/88","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra, IIIA-CSIC","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Constraints and Satisfiability","track":"Main track","number":88,"pages":{"first":631,"last":637},"keywords":["Agent-based and Multi-agent Systems: Social Choice Theory","Combinatorial & Heuristic Search: Heuristic Search","Knowledge Representation, Reasoning, and Logic: Preferences","Constraints and Satisfiability: Modeling/Formulation"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}