{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:46Z","timestamp":1759637806003},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.24963\/ijcai.2017\/88","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T09:14:07Z","timestamp":1501233247000},"page":"631-637","source":"Crossref","is-referenced-by-count":3,"title":["Finding Robust Solutions to Stable Marriage"],"prefix":"10.24963","author":[{"given":"Begum","family":"Genc","sequence":"first","affiliation":[{"name":"Insight Centre for Data Analytics, University College Cork, Cork, IE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Siala","sequence":"additional","affiliation":[{"name":"Insight Centre for Data Analytics, University College Cork, Cork, IE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"O'Sullivan","sequence":"additional","affiliation":[{"name":"Insight Centre for Data Analytics, University College Cork, Cork, IE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Simonin","sequence":"additional","affiliation":[{"name":"TASC, Institut Mines Telecom Atlantique, LS2N UMR 6004, Nantes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"26","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)","University of Technology Sydney (UTS)","Australian Computer Society (ACS)"],"acronym":"IJCAI-2017","name":"Twenty-Sixth International Joint Conference on Artificial Intelligence","start":{"date-parts":[[2017,8,19]]},"theme":"Artificial Intelligence","location":"Melbourne, Australia","end":{"date-parts":[[2017,8,26]]}},"container-title":["Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T11:52:12Z","timestamp":1501242732000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2017\/88"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2017\/88","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}