How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach

by   Sushmita Gupta, et al.

In this paper we study a resource allocation problem that encodes correlation between items in terms of and maximizes the minimum utility of the agents under a conflict free allocation. Admittedly, the problem is computationally hard even under stringent restrictions because it encodes a variant of the Maximum Weight Independent Set problem which is one of the canonical hard problems in both classical and parameterized complexity. Recently, this subject was explored by Chiarelli et al. [Algorithmica'22] from the classical complexity perspective to draw the boundary between NP-hardness and tractability for a constant number of agents. The problem was shown to be hard even for small constant number of agents and various other restrictions on the underlying graph. Notwithstanding this computational barrier, we notice that there are several parameters that are worth studying: number of agents, number of items, combinatorial structure that defines the conflict among the items, all of which could well be small under specific circumstancs. Our search rules out several parameters (even when taken together) and takes us towards a characterization of families of input instances that are amenable to polynomial time algorithms when the parameters are constant. In addition to this we give a superior 2^m|I|^O(1) algorithm for our problem where m denotes the number of items that significantly beats the exhaustive (m^m) algorithm by cleverly using ideas from FFT based fast polynomial multiplication; and we identify simple graph classes relevant to our problem's motivation that admit efficient algorithms.


page 1

page 2

page 3

page 4


Fair packing of independent sets

In this work we add a graph theoretical perspective to a classical probl...

Parameterized Complexity of Manipulating Sequential Allocation

The sequential allocation protocol is a simple and popular mechanism to ...

Fair Allocation Algorithms for Indivisible Items under Structured Conflict Constraints

We consider the fair allocation of indivisible items to several agents w...

Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring

We present a polynomial time reduction from the conflict-free colouring ...

More Effort Towards Multiagent Knapsack

In this paper, we study some multiagent variants of the knapsack problem...

Parametrized Complexity of Manipulating Sequential Allocation

The sequential allocation protocol is a simple and popular mechanism to ...

Possible and Necessary Allocations via Sequential Mechanisms

A simple mechanism for allocating indivisible resources is sequential al...

Please sign up or login with your details

Forgot password? Click here to reset