Fluschnik et al. (2019) - Fair Knapsack

From Online-Partizipation
Jump to navigation Jump to search

T. Fluschnik and P. Skowron and M. Triphaus and K. Wilker. Fair Knapsack. Proceedings of the 33rd AAAI Conference on Artificial Intelligence, To appear, 2019.

Summary

The authors describe a generalization of the knapsack problem, where there is no fixed utility function over the set of items, but a set of voters with different preferences balloting with a utility function each. The goal is similarly to the knapsack problem, to output a budget where the budgeted item cost is not exceeding the knapsack limit, while representing voters preferences. Therefore three different aggregation methods are studied, namely individually best knapsack, diverse knapsack and fair knapsack. Further complexity is shown for different restricted domains on given aggregation methods.

BibTeX

@inproceedings{flu-sko-tri-wil:c:fair-knapsack,
 author    = {Till Fluschnik and Piotr Skowron and Mervin Triphaus and Kai Wilker},
 title     = {Fair {K}napsack},
 booktitle = {Proceedings of the 33rd AAAI Conference on Artificial Intelligence},
 year      = {2019},
 note      = {Accepted for publication},
}