ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Group fairness for knapsack problems

Patel, D and Khan, A and Louis, A (2021) Group fairness for knapsack problems. In: 20th International Conference on Autonomous Agents and Multiagent Systems, 3-7 May 2021, pp. 989-997.

Full text not available from this repository.

Abstract

We study the knapsack problem with group fairness constraints. The input of the problem consists of a knapsack of bounded capacity and a set of items. Each item belongs to a particular category and has an associated weight and value. The goal of this problem is to select a subset of items such that all categories are fairly represented, the total weight of the selected items does not exceed the capacity of the knapsack, and the total value is maximized. We study the fairness parameters such as the bounds on the total value of items from each category, the total weight of items from each category, and the total number of items from each category. We give approximation algorithms for these problems. We also give experimental validation for the efficiency of our algorithms. These fairness notions could also be extended to the min-knapsack problem. The fair knapsack problems encompass various important problems, such as participatory budgeting, fair budget allocation, and advertising. © 2021 International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.

Item Type: Conference Paper
Publication: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Publisher: International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Additional Information: The copyright for this article belongs to International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Keywords: Approximation algorithms; Budget control; Combinatorial optimization; Multi agent systems, Bounded capacities; Budget allocation; Experimental validations; Fairness constraints; Knapsack problems; Total values, Autonomous agents
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 21 Nov 2021 16:28
Last Modified: 21 Nov 2021 16:28
URI: http://eprints.iisc.ac.in/id/eprint/69937

Actions (login required)

View Item View Item