arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.07832cs.DS
收藏

背包问题的群体公平性

Group Fairness for Knapsack Problems

Deval Patel, Arindam Khan, Anand Louis

摘要:

研究了具有群体公平性约束的背包问题。问题的输入由一个有界容量的背包和一组物品组成,每个物品属于一个特定的类别,并具有相关的权重和值。这个问题的目标是选择一个子集的项目,使所有类别都公平地表示,所选项目的总重量不超过背包的容量,总价值最大化。我们研究的公平性参数,如从每个类别的项目的总价值的界限,从每个类别的项目的总权重,从每个类别的项目的总数。我们给出了这些问题的近似算法。这些公平的概念也可以扩展到最小背包问题。公平背包问题包含了参与式预算、公平预算分配、广告等重要问题。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑