Genc, Begum; Siala, Mohamed; Simonin, Gilles; O'Sullivan, Barry
(International Joint Conferences on Artificial Intelligence Organization, 2017-08)
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 ...