Solving the Maximum Popular Matching Problem with Matroid Constraints

09/06/2022
by   Gergely Csáji, et al.
0

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 Kamiyama [TCS 2020] and solved in the special case where matroids are base orderable. Utilizing a recently shown matroid exchange property, we show that the problem is tractable for arbitrary matroids.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset