Fair Knapsack

Till Fluschnik
Till Fluschnik
Mervin Triphaus
Mervin Triphaus
Kai Wilker
Kai Wilker

AAAI, Volume abs/1711.04520, 2019.

Cited by: 17|Views11
EI

Abstract:

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 consisten...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments