9 citations · 17 across the 3 of their papers we have counts for
1 paper · 2 filters
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…