Solving the Maximum Popular Matching Problem with Matroid Constraints – new study by Gergely Csáji and co-authors
Solving the Maximum Popular Matching Problem with Matroid Constraints Gergely Csáji, Tamás Király, and Yu Yokoi SIAM Journal on Discrete Mathematics – Vol. 38, Iss. 3 (2024) Abstract 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 […]
