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.
Lipton, Evangelos Markakis, Elchanan Mossel, and Amin Saberi
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
fields
cs.GT 5representative citing papers
Optimal deterministic strategyproof (and group strategyproof) mechanisms minimizing envy ratio are characterized for two interval-restricted one-facility location settings on the line, with lower and upper bounds given for randomized mechanisms.
Existence of EF1 and constant-ρ MMS allocations proven for submodular valuations.
Simpler poly-time constructions for EF2X/EF3X and improved √2/2-EFX and 2/3-EFX approximations for monotone and additive valuations in restricted hypergraphs.
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.
-
Facility Location Game with Envy Ratio
Optimal deterministic strategyproof (and group strategyproof) mechanisms minimizing envy ratio are characterized for two interval-restricted one-facility location settings on the line, with lower and upper bounds given for randomized mechanisms.
-
Simultaneous EF1 and approximate MMS allocations for submodular valuations
Existence of EF1 and constant-ρ MMS allocations proven for submodular valuations.
-
Almost EFX in Hypergraphs
Simpler poly-time constructions for EF2X/EF3X and improved √2/2-EFX and 2/3-EFX approximations for monotone and additive valuations in restricted hypergraphs.
- EconCSLib: AI-Assisted Lean Formalization for Economics & Computation research