DeepAI AI Chat
Log In Sign Up

Group Fairness for Knapsack Problems

by   Deval Patel, et al.

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 and 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. 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, advertising.


page 1

page 2

page 3

page 4


Fairness Concepts for Indivisible Items with Externalities

We study a fair allocation problem of indivisible items under additive e...

Fair Knapsack

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

Approximation Schemes for Multiperiod Binary Knapsack Problems

An instance of the multiperiod binary knapsack problem (MPBKP) is given ...

Time Fairness in Online Knapsack Problems

The online knapsack problem is a classic problem in the field of online ...

An FPTAS for Stochastic Unbounded Min-Knapsack Problem

In this paper, we study the stochastic unbounded min-knapsack problem (M...

Individual Fairness in Sponsored Search Auctions

Fairness in advertising is a topic of particular interest in both the co...

Multi-Category Fairness in Sponsored Search Auctions

Fairness in advertising is a topic of particular concern motivated by th...