<div class="csl-bib-body">
<div class="csl-entry">Deligkas, A., Eiben, E., Ganian, R., Hamm, T., & Ordyniak, S. (2026). The complexity of envy-free graph cutting. <i>Artificial Intelligence</i>, <i>358</i>, Article 104585. https://doi.org/10.1016/j.artint.2026.104585</div>
</div>
-
dc.identifier.issn
0004-3702
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/230271
-
dc.description.abstract
We consider the problem of fairly dividing a set of heterogeneous divisible resources among a set of agents with different preferences. We focus on the case where the resources correspond to the edges of a connected graph, every agent must be assigned a connected piece of this graph, and the fairness notion considered is the classical envy-freeness. The problem is NP-complete, and we analyze its complexity with respect to two natural complexity measures: the number of agents, and the number of edges in the graph. While the problem remains NP-hard even for instances with 2 agents, we provide a dichotomy characterizing the complexity of the problem when the number of agents is constant based on structural properties of the input graph. For the latter case, we design a polynomial-time algorithm for the problem when the graph has a constant number of edges.
