Parameterized complexity of envy-free resource allocation in social networks

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 info...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Artificial intelligence Ročník 315; s. 103826
Hlavní autoři: Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Ordyniak, Sebastian
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.02.2023
Témata:
Clique-width
Computational social choice
Parameterized complexity
Resource allocation
Treewidth
Computational social choice
Parameterized complexity
Resource allocation
Treewidth
Clique-width
ISSN:0004-3702, 1872-7921
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0004-3702
1872-7921
DOI:10.1016/j.artint.2022.103826