arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.12430cs.CC
收藏

近似#背包计算来计算半公平分配

Approximate #Knapsack Computations to Count Semi-Fair Allocations

Theofilos Triommatis, Aris Pagourtzis

摘要:

本文研究了具有给定基数的不同背包解的个数的计数问题。我们提出了一个FPTAS为这个问题,基于动态规划。我们还介绍了两种不同类型的半公平分配的不可分割的商品之间的两个球员。所谓半公平分配,我们指的是确保两个参与者中至少有一个不会嫉妒的分配。我们研究的问题,计数这样的分配,我们提供FPTAS为这两种类型,采用我们的FPTAS为规定的基数背包问题。

英文摘要:

In this paper, we study the problem of counting the number of different knapsack solutions with a prescribed cardinality. We present an FPTAS for this problem, based on dynamic programming. We also introduce two different types of semi-fair allocations of indivisible goods between two players. By semi-fair allocations, we mean allocations that ensure that at least one of the two players will be free of envy. We study the problem of counting such allocations and we provide FPTASs for both types, by employing our FPTAS for the prescribed cardinality knapsack problem.

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

↑