Two polynomial-time algorithms are proposed for multilevel fair allocation under matroid-rank preferences, one generic with efficiency and fairness guarantees and one extending General Yankee Swap with efficiency guarantees and strong practical fairness.
In contrast,GYSon the leaves performs very poorly in terms of fairness
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multilevel Fair Allocation with Matroid-Rank Preferences
Two polynomial-time algorithms are proposed for multilevel fair allocation under matroid-rank preferences, one generic with efficiency and fairness guarantees and one extending General Yankee Swap with efficiency guarantees and strong practical fairness.