Our input instance is a bipartite graph G where each vertex has a preference list ranking its neighbors in a strict order of preference. A matching M is popular if there is no matching N such that …
Yang Liu - Aryanfar, Iman - Eggleton, Benjamin J. - Marpaung, David - Pagani, Mattia - Morrison, Blair - Choudhary, Amol - Shahnia, Shayan - Khu Vu - Madden, Stephen