Finding Robust Solutions to Stable Marriage

Begum Genc, Mohamed Siala, Barry O'Sullivan +1

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…