The paper introduces strong simultaneous envy-freeness up to c goods for multidimensional fair division, proves existence bounds independent of the item count, and shows NP-hardness for checking weak and strong sEF1.
Computational social choice: Some current and new directions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Simultaneously Fair Allocation of Indivisible Items Across Multiple Dimensions
The paper introduces strong simultaneous envy-freeness up to c goods for multidimensional fair division, proves existence bounds independent of the item count, and shows NP-hardness for checking weak and strong sEF1.