Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
Claire Chang, Arin Khare, David Shmoys

TL;DR
This paper develops polynomial algorithms to optimize fairness in complex kidney exchange models, extending previous matching theories to weighted and path-based structures, supported by computational experiments.
Contribution
It introduces strongly polynomial algorithms for fairness in weighted kidney exchange structures, generalizing beyond maximum cardinality matchings.
Findings
Algorithms guarantee fairness properties in weighted settings
NP-hardness of coverage with cycles and paths of length ≥3
Computational results show benefits of fairness in real and synthetic data
Abstract
The seminal work of Roth, S\"onmez, & \"Unver shows that the Edmonds-Gallai structure theorem for non-bipartite matching can be leveraged to yield a randomized algorithm to match patient-donor pairs in kidney exchange with extraordinarily strong properties. This breakthrough led to randomized polynomial-time algorithms to find a maximum-cardinality matching maximizing individual fairness objectives--measured by the probability that nodes are matched--such as Nash social welfare. But the exchanges allowed in practice go beyond cardinality matching, generalizing to weighted variants and allowing structures such as paths and 3-cycles. We show that strongly polynomial algorithms guaranteeing the same fairness properties can be obtained in weighted settings for matching and 2-paths. While even maximum cardinality coverage with cycles and paths of length at least three is NP-hard, we provide…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
