Showing cs.DSShow all
3 papers · 1 filter
cs.DS2024
Optimal Capacity Modification for Stable Matchings with Ties
Keshav Ranjan, Meghana Nasre, Prajakta Nimbhorkar
We consider the Hospitals/Residents (HR) problem in the presence of ties in hospital preferences. Among the three notions of stability, namely weak stability, strong stability, and…
cs.DS2023
Critical Relaxed-Stable Matchings with Ties in the Many-to-Many Setting
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan
We study the many-to-many bipartite matching problem in the presence of preferences where ties, as well as lower quotas, may appear on both sides of the bipartition. The input is a…
cs.DS2022
Popular Critical Matchings in the Many-to-Many Setting
Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan +1
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 U B,…