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

page 1

page 2

page 3

page 4

research
10/23/2019

NC Algorithms for Popular Matchings in One-Sided Preference Systems and Related Problems

The popular matching problem is of matching a set of applicants to a set...
research
09/18/2023

Maintaining Matroid Intersections Online

Maintaining a maximum bipartite matching online while minimizing recours...
research
06/24/2022

Popular Critical Matchings in the Many-to-Many Setting

We consider the many-to-many bipartite matching problem in the presence ...
research
02/05/2021

Cutoff stability under distributional constraints with an application to summer internship matching

We introduce a new two-sided stable matching problem that describes the ...
research
08/14/2018

Finding Minimal Cost Herbrand Models with Branch-Cut-and-Price

Given (1) a set of clauses T in some first-order language L and (2) a c...
research
10/24/2022

Matching Map Recovery with an Unknown Number of Outliers

We consider the problem of finding the matching map between two sets of ...
research
07/07/2021

An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints

We present a polynomial-time 3/2-approximation algorithm for the problem...

Please sign up or login with your details

Forgot password? Click here to reset