Cseh, Ágnes; Kavitha, Telikepalli - 2017
Given a bipartite graph G=(A B, E) with strict preference lists and given an edge e E, we ask if there exists a popular matching in G that contains e. We call this the popular edge problem. A matching M is popular if there is no matching M' such that the vertices that prefer M' to M outnumber...
