Allocation of Indivisible Items with Individual Preference Graphs

02/09/2022
by   Nina Chiarelli, et al.
0

This paper studies the allocation of indivisible items to agents, when each agent's preferences are expressed by means of a directed acyclic graph. The vertices of each preference graph represent the subset of items approved of by the respective agent. An arc (a,b) in such a graph means that the respective agent prefers item a over item b. We introduce a new measure of dissatisfaction of an agent by counting the number of non-assigned items which are approved of by the agent and for which no more preferred item is allocated to the agent. Considering two problem variants, we seek an allocation of the items to the agents in a way that minimizes (i) the total dissatisfaction over all agents or (ii) the maximum dissatisfaction among the agents. For both optimization problems we study the status of computational complexity and obtain NP-hardness results as well as polynomial algorithms with respect to natural underlying graph structures, such as stars, trees, paths, and matchings. We also analyze the parameterized complexity of the two problems with respect to various parameters related to the number of agents, the dissatisfaction threshold, the vertex degrees of the preference graphs, and the treewidth.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/15/2019

Algorithms for Manipulating Sequential Allocation

Sequential allocation is a simple and widely studied mechanism to alloca...
research
04/01/2020

Parameterized Analysis of Assignment Under Multiple Preferences

The Assignment problem is a fundamental, well-studied problem in the int...
research
08/04/2022

More Effort Towards Multiagent Knapsack

In this paper, we study some multiagent variants of the knapsack problem...
research
09/21/2022

On Reachable Assignments under Dichotomous Preferences

We consider the problem of determining whether a target item assignment ...
research
05/21/2021

Verification of Multi-Layered Assignment Problems

The class of assignment problems is a fundamental and well-studied class...
research
02/03/2022

Multivariate Algorithmics for Eliminating Envy by Donating Goods

Fairly dividing a set of indivisible resources to a set of agents is of ...
research
04/22/2015

Allocating Indivisible Items in Categorized Domains

We formulate a general class of allocation problems called categorized d...

Please sign up or login with your details

Forgot password? Click here to reset