research
∙
03/22/2023
Critical Relaxed Stable Matchings with Two-Sided Ties
We consider the stable marriage problem in the presence of ties in prefe...
share
research
∙
03/20/2023
Fair Healthcare Rationing to Maximize Dynamic Utilities
Allocation of scarce healthcare resources under limited logistic and inf...
research
∙
01/25/2023
EFX Exists for Four Agents with Three Types of Valuations
In this paper, we address the problem of determining an envy-free alloca...
research
∙
09/22/2022
Popular Edges with Critical Nodes
In the popular edge problem, the input is a bipartite graph G = (A ∪ B,E...
research
∙
08/24/2022
Matchings Under Diversity Constraints
Matching problems with group fairness constraints have numerous applicat...
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
∙
05/20/2021
Matchings with Group Fairness Constraints: Online and Offline Algorithms
We consider the problem of assigning items to platforms in the presence ...
research
∙
11/26/2020
Disjoint Stable Matchings in Linear Time
We show that given a SM instance G as input we can find a largest collec...
research
∙
10/16/2019
Maximum-Size Envy-free Matchings
We consider the problem of assigning residents to hospitals when hospita...
research
∙
05/08/2018
Dichotomy Results for Classified Rank-Maximal Matchings and Popular Matchings
In this paper, we consider the problem of computing an optimal matching ...
research
∙
04/28/2018
