DeepAI AI Chat
Log In Sign Up

Fair Knapsack

by   Till Fluschnik, et al.

We study the following multiagent variant of the knapsack problem. We are given a set of items, a set of voters, and a value of the budget; each item is endowed with a cost and each voter assigns to each item a certain value. The goal is to select a subset of items with the total cost not exceeding the budget, in a way that is consistent with the voters' preferences. Since the preferences of the voters over the items can vary significantly, we need a way of aggregating these preferences, in order to select the socially most preferred valid knapsack. We study three approaches to aggregating voters preferences, which are motivated by the literature on multiwinner elections and fair allocation. This way we introduce the concepts of individually best, diverse, and fair knapsack. We study computational complexity (including parameterized complexity, and complexity under restricted domains) of computing the aforementioned concepts of multiagent knapsacks.


page 1

page 2

page 3

page 4


Group Fairness for Knapsack Problems

We study the knapsack problem with group fairness constraints. The input...

Generic Preferences over Subsets of Structured Objects

Various tasks in decision making and decision support systems require se...

Allocation of Indivisible Items with Individual Preference Graphs

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

Participatory Budgeting with Cumulative Votes

In participatory budgeting we are given a set of projects—each with a co...

More Effort Towards Multiagent Knapsack

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

Markov Determinantal Point Processes

A determinantal point process (DPP) is a random process useful for model...

Unified Fair Allocation of Goods and Chores via Copies

We consider fair allocation of indivisible items in a model with goods, ...