
Matchings with Group Fairness Constraints: Online and Offline Algorithms
We consider the problem of assigning items to platforms in the presence ...
read it

Fair Knapsack
We study the following multiagent variant of the knapsack problem. We ar...
read it

Approximation Schemes for Multiperiod Binary Knapsack Problems
An instance of the multiperiod binary knapsack problem (MPBKP) is given ...
read it

An FPTAS for Stochastic Unbounded MinKnapsack Problem
In this paper, we study the stochastic unbounded minknapsack problem (M...
read it

Allocating Indivisible Items in Categorized Domains
We formulate a general class of allocation problems called categorized d...
read it

MultiCategory Fairness in Sponsored Search Auctions
Fairness in advertising is a topic of particular concern motivated by th...
read it

Individual Fairness in Sponsored Search Auctions
Fairness in advertising is a topic of particular interest in both the co...
read it
Group Fairness for Knapsack Problems
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 minknapsack problem. The fair knapsack problems encompass various important problems, such as participatory budgeting, fair budget allocation, advertising.
READ FULL TEXT
Comments
There are no comments yet.