Eiben, E, Ganian, R, Hamm, T et al. (1 more author) (2020) Parameterized complexity of envy-free resource allocation in social networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. Thirty-Fourth AAAI Conference on Artificial Intelligence, 07-12 Feb 2020, New York, New York, USA. , pp. 7135-7142. ISBN 9781577358350
Abstract
We consider the classical problem of allocating 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 items. In particular, we show that even very general fragments of the considered problems become tractable as long as the social network has bounded treewidth or bounded clique-width. We complement our results with matching lower bounds which show that our algorithms cannot be substantially improved.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Funding Information: | Funder Grant number EPSRC (Engineering and Physical Sciences Research Council) EP/V00252X/1 |
Depositing User: | Symplectic Publications |
Date Deposited: | 22 Jul 2021 08:39 |
Last Modified: | 06 Aug 2021 10:08 |
Status: | Published |
Identification Number: | 10.1609/aaai.v34i05.6201 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:176329 |