集合覆盖的成本分配:快乐核仁
Cost Allocation for Set Covering: the Happy Nucleolus
AI总结:
本文研究集合覆盖成本分配问题,提出“快乐核仁”概念,并证明其可由至多 mn 个平凡覆盖子集完全确定,从而可在多项式时间内计算,克服了传统核仁的 NP 难问题。
摘要:
我们考虑集合覆盖问题的成本分配。在不违反群体理性条件(任何玩家子集支付的费用不超过覆盖该子集所需的成本)的前提下,我们尽可能多地将成本分配给元素(玩家),并且使得超额向量按字典序最大化。如果对应合作博弈的核非空,即某个最优分数覆盖是整数覆盖,那么这与众所周知的核仁完全相同。在一般情况下,我们称之为“快乐核仁”。与核仁一样,超额向量包含每个玩家子集的一个条目,而不仅仅是给定集合覆盖实例中的集合。此外,计算单个条目是 NP 难的,因为这需要求解一个集合覆盖问题。尽管如此,我们给出了一个显式的子集族,其规模至多为 $mn$,其中每个子集都有一个平凡的覆盖(由单个集合覆盖),使得快乐核仁总是完全由这个代理超额向量决定;这里 $m$ 和 $n$ 分别表示集合覆盖实例中集合的数量和玩家的数量。我们证明在自然意义下,这是唯一的最小这样的子集族。虽然计算集合覆盖的核仁是 NP 难的,但我们的结果意味着快乐核仁可以在多项式时间内计算。
英文摘要:
We consider cost allocation for set covering problems. We allocate as much cost to the elements (players) as possible without violating the group rationality condition (no subset of players pays more than covering this subset would cost), and so that the excess vector is lexicographically maximized. This is identical to the well-known nucleolus if the core of the corresponding cooperative game is nonempty, i.e., if some optimum fractional cover is integral. In general, we call this the 'happy nucleolus'. Like for the nucleolus, the excess vector contains an entry for every subset of players, not only for the sets in the given set covering instance. Moreover, it is NP-hard to compute a single entry because this requires solving a set covering problem. Nevertheless, we give an explicit family of at most $mn$ subsets, each with a trivial cover (by a single set), such that the happy nucleolus is always completely determined by this proxy excess vector; here $m$ and $n$ denote the number of sets and the number of players in our set covering instance. We show that this is the unique minimal such family in a natural sense. While computing the nucleolus for set covering is NP-hard, our results imply that the happy nucleolus can be computed in polynomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。