Cost Allocation for Set Covering: the Happy Nucleolus
Operations Research Letters(2024)
摘要
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, and so that the excess vector is lexicographically maximized. This happy nucleolus has several nice properties. In particular, we show that it can be computed considering a small subset of “simple” coalitions only. While computing the nucleolus for set covering is NP-hard, our results imply that the happy nucleolus can be computed in polynomial time.
更多查看译文
关键词
Cooperative Game Theory,Cost Allocation,Happy Nucleolus,Set Covering
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要