The paper introduces a hierarchy of strong chromatic number variants to characterize and algorithmically guarantee SD-EF1, EF1, and EF[1,1] allocations under graph conflict constraints, showing 3Δ-1 agents suffice for any graph of maximum degree Δ.
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
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fair Allocation under Conflict Constraints via Strong Colorability
The paper introduces a hierarchy of strong chromatic number variants to characterize and algorithmically guarantee SD-EF1, EF1, and EF[1,1] allocations under graph conflict constraints, showing 3Δ-1 agents suffice for any graph of maximum degree Δ.