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 条
  • [21] Fair allocation of indivisible goods and chores
    Haris Aziz
    Ioannis Caragiannis
    Ayumi Igarashi
    Toby Walsh
    Autonomous Agents and Multi-Agent Systems, 2022, 36
  • [22] Distributed fair allocation of indivisible goods
    Chevaleyre, Yann
    Endriss, Ulle
    Maudet, Nicolas
    ARTIFICIAL INTELLIGENCE, 2017, 242 : 1 - 22
  • [23] Democratic Fair Allocation of Indivisible Goods
    Segal-Halevi, Erel
    Suksompong, Warut
    PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 482 - 488
  • [24] Fair Allocation of Indivisible Goods: Improvement
    Ghodsi, Mohammad
    Hajiaghayi, Mohammad Taghi
    Seddighin, Masoud
    Seddighin, Saeed
    Yami, Hadi
    MATHEMATICS OF OPERATIONS RESEARCH, 2021, 46 (03) : 1038 - 1053
  • [25] Fair Allocation of Indivisible Public Goods
    Fain, Brandon
    Munagala, Kamesh
    Shah, Nisarg
    ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2018, : 575 - 592
  • [26] Fair Allocation of Indivisible Goods and Chores
    Aziz, Haris
    Caragiannis, Ioannis
    Igarashi, Ayumi
    Walsh, Toby
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 53 - 59
  • [27] On Fair and Efficient Allocations of Indivisible Goods
    Murhekar, Aniket
    Garg, Jugal
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 5595 - 5602
  • [28] Democratic fair allocation of indivisible goods
    Segal-Halevi, Erel
    Suksompong, Warut
    ARTIFICIAL INTELLIGENCE, 2019, 277
  • [29] Fair allocation of indivisible goods and chores
    Aziz, Haris
    Caragiannis, Ioannis
    Igarashi, Ayumi
    Walsh, Toby
    AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2022, 36 (01)
  • [30] Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity
    Bouveret, Sylvain
    Lang, Jerome
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2008, 32 (525-564): : 525 - 564