On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings

Yuga Kanaya, Kenjiro Takazawa

Popular matchings provide a model of matching under preferences in which a solution corresponds to a Condorcet winner in voting systems. In a bipartite graph in which the vertices…