ER-k and NW-k relaxations of fairness and non-wastefulness are always compatible under hereditary constraints, with two equivalent polynomial-time algorithms to compute such matchings.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Compatible $k$-Relaxations of Fairness and Non-Wastefulness Under Hereditary Constraints
ER-k and NW-k relaxations of fairness and non-wastefulness are always compatible under hereditary constraints, with two equivalent polynomial-time algorithms to compute such matchings.