Cseh, Ágnes; Huang, Chien-Chung; Kavitha, Telikepalli - 2017
We are given a bipartite graph G = (A B;E) where each vertex has a preference list ranking its neighbors: in particular, every a A ranks its neighbors in a strict order of preference, whereas the preference list of any b B may contain ties. A matching M is popular if there is no matching M' such...
