Maximum Matchings and Popularity

Telikepalli Kavitha

Let $G$ be a bipartite graph where every node has a strict ranking of its neighbors. For every node, its preferences over neighbors extend naturally to preferences over matchings.…