The price to pay for forgoing normalization in fair division of indivisible goods

被引:1
|
作者
Lange, Pascal [1 ]
Nguyen, Nhan-Tam [1 ]
Rothe, Joerg [1 ]
机构
[1] Heinrich Heine Univ Dusseldorf, Inst Informat, D-40225 Dusseldorf, Germany
关键词
Fair division; Indivisible goods; Social welfare; Computational complexity; SOCIAL-WELFARE OPTIMIZATION; APPROXIMABILITY; COMPLEXITY;
D O I
10.1007/s10472-019-09659-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We study the complexity of fair division of indivisible goods and consider settings where agents can have nonzero utility for the empty bundle. This is a deviation from a common normalization assumption in the literature, and we show that this inconspicuous change can lead to an increase in complexity: In particular, while an allocation maximizing social welfare by the Nash product is known to be easy to detect in the normalized setting whenever there are as many agents as there are resources, without normalization it can no longer be found in polynomial time, unless P = NP. The same statement also holds for egalitarian social welfare. Moreover, we show that it is NP-complete to decide whether there is an allocation whose Nash product social welfare is above a certain threshold if the number of resources is a multiple of the number of agents. Finally, we consider elitist social welfare and prove that the increase in expressive power by allowing negative coefficients again yields NP-completeness.
引用
收藏
页码:817 / 832
页数:16
相关论文
共 35 条
  • [1] The price to pay for forgoing normalization in fair division of indivisible goods
    Pascal Lange
    Nhan-Tam Nguyen
    Jörg Rothe
    Annals of Mathematics and Artificial Intelligence, 2020, 88 : 817 - 832
  • [2] Population monotonicity in fair division of multiple indivisible goods
    Dogan, Emre
    INTERNATIONAL JOURNAL OF GAME THEORY, 2021, 50 (02) : 361 - 376
  • [3] Population monotonicity in fair division of multiple indivisible goods
    Emre Doğan
    International Journal of Game Theory, 2021, 50 : 361 - 376
  • [4] Fair Division of Indivisible Goods Among Strategic Agents
    Barman, Siddharth
    Ghalme, Ganesh
    Jain, Shweta
    Kulkarni, Pooja
    Narang, Shivika
    AAMAS '19: PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2019, : 1811 - 1813
  • [5] Fair division of mixed divisible and indivisible goods
    Bei, Xiaohui
    Li, Zihao
    Liu, Jinyan
    Liu, Shengxin
    Lu, Xinhang
    ARTIFICIAL INTELLIGENCE, 2021, 293
  • [6] Characterizing Conflicts in Fair Division of Indivisible Goods Using a Scale of Criteria
    Bouveret, Sylvain
    Lemaitre, Michel
    AAMAS'14: PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2014, : 1321 - 1328
  • [7] Characterizing conflicts in fair division of indivisible goods using a scale of criteria
    Bouveret, Sylvain
    Lemaitre, Michel
    AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2016, 30 (02) : 259 - 290
  • [8] Characterizing conflicts in fair division of indivisible goods using a scale of criteria
    Sylvain Bouveret
    Michel Lemaître
    Autonomous Agents and Multi-Agent Systems, 2016, 30 : 259 - 290
  • [9] The Price of Fairness for Indivisible Goods
    Xiaohui Bei
    Xinhang Lu
    Pasin Manurangsi
    Warut Suksompong
    Theory of Computing Systems, 2021, 65 : 1069 - 1093
  • [10] The Price of Fairness for Indivisible Goods
    Bei, Xiaohui
    Lu, Xinhang
    Manurangsi, Pasin
    Suksompong, Warut
    THEORY OF COMPUTING SYSTEMS, 2021, 65 (07) : 1069 - 1093