Journal
OPERATIONS RESEARCH
Volume 67, Issue 6, Pages 1503-1519Publisher
INFORMS
DOI: 10.1287/opre.2019.1909
Keywords
stable matching; diversity; Scarf's lemma
Funding
- National Science Foundation (NSF) [1728165]
- NSF [1763307]
- Foundations of Fair Data Analysis
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [1763307] Funding Source: National Science Foundation
- Div Of Civil, Mechanical, & Manufact Inn
- Directorate For Engineering [1728165] Funding Source: National Science Foundation
Ask authors/readers for more resources
The problem of finding stable matches that meet distributional concerns is usually formulated by imposing side constraints whose right-hand sides are absolute numbers specified before the preferences or number of agents on the proposing side are known. In many cases, it is more natural to express the relevant constraints as proportions. We treat such constraints as soft but provide ex post guarantees on how well the constraints are satisfied while preserving stability. Our technique requires an extension of Scarf's lemma, which is of independent interest.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available