The authors derive near-tight subsidy bounds for equitable allocations, characterize allocations that achieve both equitability and envy-freeness with the same payments, and provide approximation algorithms for welfare guarantees.
Existence and computation of maximin fair allocations under matroid-rank valuations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Achieving Equitability with Subsidy
The authors derive near-tight subsidy bounds for equitable allocations, characterize allocations that achieve both equitability and envy-freeness with the same payments, and provide approximation algorithms for welfare guarantees.