Popular critical matchings in the many-to-many setting

We consider the many-to-many bipartite matching problem in the presence of two-sided preferences and two-sided lower quotas. The input to our problem is a bipartite graph G = (a boolean OR B, E), where each vertex in A boolean OR B. specifies a strict preference ordering over its neighbours. Each vertex has an upper quota denoting the maximum number of vertices that can be assigned to it. In addition, each vertex has a lower quota denoting the minimum number of vertices that need to be assigned to it. In the many-to-many setting with two-sided lower quotas, informally, a critical matching is a matching which fulfils vertex lower quotas to the maximum possible extent. This is a natural generalization of the definition of critical matching in the one-to-one setting considered by Kavitha (FSTTCS 2021). In this work, our goal is to find a popular matching in the set of critical matchings. A matching is popular in a given set of matchings if it remains undefeated in a head-to-head election with any matching in that set. Here, vertices cast votes between pairs of matchings. We show that there always exists a matching that is popular in the set of critical matchings. We present an efficient algorithm to compute such a matching of the largest size. We prove the popularity of our matching using a dual certificate.

Automated summary

This paper studies the many-to-many bipartite matching problem with two-sided preferences and two-sided lower quotas. By defining the concept of critical matching, the goal is to find a popular matching in the set of critical matchings, and an efficient algorithm is proposed to compute a popular matching of the largest size.