Solving the Maximum Popular Matching Problem with Matroid Constraints

Gergely Csáji, Tamás Király, Yu Yokoi

We consider the problem of finding a maximum popular matching in a many-to-many matching setting with two-sided preferences and matroid constraints. This problem was proposed by Ka…