Two-Sided Fairness in Many-to-One Matching

Abstract: We consider a classic many-to-one matching setting, where participants need to be assigned to teams based on the preferences of both sides. Unlike most of the matching literature, we aim to provide fairness not only to participants, but also to teams using concepts from the literature of fair division. We present a polynomial-time algorithm that computes an allocation satisfying team-justified envy-freeness up to one participant, participant-justified envy-freeness, balancedness, Pareto optimality, and group-strategyproofness for participants, even in the possible presence of ties. Our algorithm generalizes both the Gale-Shapley algorithm from two-sided matching as well as the round-robin algorithm from fair division. We also discuss how our algorithm can be extended to accommodate quotas and incomplete preferences.