Parameterized Complexity of Envy-Free Resource Allocation in Social Networks

Eiben, E, Ganian, R, Hamm, T et al. (1 more author) (2023) Parameterized Complexity of Envy-Free Resource Allocation in Social Networks. Artificial Intelligence, 315. 103826. ISSN 0004-3702

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2022 Published by Elsevier B.V. This is an author produced version of an article, published in Artificial Intelligence. Uploaded in accordance with the publisher's self-archiving policy.

Keywords: Resource allocation; Parameterized complexity; Computational social choice; Treewidth; Clique-width
Dates:
  • Published: February 2023
  • Published (online): 15 November 2022
  • Accepted: 10 November 2022
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: 05 Dec 2022 12:49
Last Modified: 15 Nov 2023 01:13
Status: Published
Publisher: Elsevier
Identification Number: 10.1016/j.artint.2022.103826
Open Archives Initiative ID (OAI ID):

Download

Filename: Envy.pdf

Licence: CC-BY-NC-ND 4.0

Export

Statistics