Log In Sign Up

More Effort Towards Multiagent Knapsack

by   Sushmita Gupta, et al.

In this paper, we study some multiagent variants of the knapsack problem. Fluschnik et al. [AAAI 2019] considered the model in which every agent assigns some utility to every item. They studied three preference aggregation rules for finding a subset (knapsack) of items: individually best, diverse, and Nash-welfare-based. Informally, diversity is achieved by satisfying as many voters as possible. Motivated by the application of aggregation operators in multiwinner elections, we extend the study from diverse aggregation rule to Median and Best scoring functions. We study the computational and parameterized complexity of the problem with respect to some natural parameters, namely, the number of voters, the number of items, and the distance from an easy instance. We also study the complexity of the problem under domain restrictions. Furthermore, we present significantly faster parameterized algorithms with respect to the number of voters for the diverse aggregation rule.


page 1

page 2

page 3

page 4


Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule

Answering an open question by Betzler et al. [Betzler et al., JAIR'13], ...

Allocation of Indivisible Items with Individual Preference Graphs

This paper studies the allocation of indivisible items to agents, when e...

Parameterized Analysis of Assignment Under Multiple Preferences

The Assignment problem is a fundamental, well-studied problem in the int...

Fair Knapsack

We study the following multiagent variant of the knapsack problem. We ar...

Diversity in Kemeny Rank Aggregation: A Parameterized Approach

In its most traditional setting, the main concern of optimization theory...

Robust Allocations with Diversity Constraints

We consider the problem of allocating divisible items among multiple age...

FPT Algorithms for Diverse Collections of Hitting Sets

In this work, we study the d-Hitting Set and Feedback Vertex Set problem...