Popularity, Mixed Matchings, and Self-Duality

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 ...