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
相关论文
共 50 条
  • [31] Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
    Bouveret, Sylvain
    Lang, Jerome
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 935 - 940
  • [32] On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
    de Keijzer, Bart
    Bouveret, Sylvain
    Klos, Tomas
    Zhang, Yingqian
    ALGORITHMIC DECISION THEORY, PROCEEDINGS, 2009, 5783 : 98 - +
  • [33] Egalitarian Price of Fairness for Indivisible Goods
    Koswara, Ivan Adrian (ivanak@comp.nus.edu.sg), 1600, Springer Science and Business Media Deutschland GmbH (14325 LNAI):
  • [34] Groupwise Maximin Fair Allocation of Indivisible Goods
    Barman, Siddharth
    Biswas, Arpita
    Krishnamurthy, Sanath Kumar
    Narahari, Yadati
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 916 - 923
  • [35] FAIR ALLOCATION OF INDIVISIBLE GOODS AND CRITERIA OF JUSTICE
    ALKAN, A
    DEMANGE, G
    GALE, D
    ECONOMETRICA, 1991, 59 (04) : 1023 - 1039
  • [36] On Fair and Efficient Allocations of Indivisible Public Goods
    Garg, Jugal
    Kulkarni, Pooja
    Murhekar, Aniket
    Leibniz International Proceedings in Informatics, LIPIcs, 2021, 213
  • [37] Fair Allocation of Indivisible Goods: Improvements and Generalizations
    Ghodsi, Mohammad
    Hajiaghayi, MohammadTaghi
    Seddighin, Masoud
    Seddighin, Saeed
    Yami, Hadi
    ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2018, : 539 - 556
  • [38] Fair allocation in a general model with indivisible goods
    Beviá C.
    Review of Economic Design, 1998, 3 (3) : 195 - 213
  • [39] Fair allocation of indivisible goods to asymmetric agents
    Farhadi A.
    Ghodsi M.
    Hajiaghayi M.
    Lahaie S.
    Pennock D.
    Seddighin M.
    Seddighin S.
    Yami H.
    Journal of Artificial Intelligence Research, 2019, 64 : 1 - 20
  • [40] Fair Allocation of Indivisible Goods to Asymmetric Agents
    Farhadi, Alireza
    Ghodsi, Mohammad
    Hajiaghayi, MohammadTaghi
    Lahaie, Sebastien
    Pennock, David
    Seddighin, Masoud
    Seddighin, Saeed
    Yami, Hadi
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2019, 64 : 1 - 20