Parameterized complexity of envy-free resource allocation in social networks

Eduard Eiben, Robert Ganian, Thekla Hamm, Sebastian Ordyniak

Research output: Contribution to journalArticlepeer-review


We consider the classical problem of allocating indivisible resources among agents in an envy-free (and, where applicable, proportional) way. Recently, the basic model was enriched by introducing the concept of a social network which allows to capture situations where agents might not have full information about the allocation of all resources. We initiate the study of the parameterized complexity of these resource allocation problems by considering natural parameters which capture structural properties of the network and similarities between agents and resources. In particular, we show that even very general fragments of the considered problems become tractable as long as the social network has constant treewidth or clique-width. We complement our results with matching lower bounds which show that our algorithms cannot be substantially improved.
Original languageEnglish
Article number103826
Number of pages20
JournalArtificial Intelligence
Early online date15 Nov 2022
Publication statusPublished - Feb 2023

Cite this