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 条
  • [41] Fair Allocation of Indivisible Goods to Asymmetric Agents
    Farhadi, Alireza
    Ghodsi, Mohammad
    Lahaie, Sebastien
    Pennock, David
    Seddighin, Masoud
    Seddighin, Saeed
    Yami, Hadi
    AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2017, : 1535 - 1537
  • [42] On Regular and Approximately Fair Allocations of Indivisible Goods
    Ferraioli, Diodato
    Gourves, Laurent
    Monnot, Jerome
    AAMAS'14: PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2014, : 997 - 1004
  • [43] Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
    Bouveret, Sylvain
    Endriss, Ulle
    Lang, Jerome
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 387 - 392
  • [44] Weighted fair division of indivisible items: A review
    Suksompong, Warut
    INFORMATION PROCESSING LETTERS, 2025, 187
  • [45] The Complexity of Fair Division of Indivisible Items with Externalities
    Deligkas, Argyrios
    Eiben, Eduard
    Korchemna, Viktoriia
    Schierreich, Simon
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 9, 2024, : 9653 - 9661
  • [46] Fair allocation of indivisible goods: Beyond additive valuations
    Ghodsi, Mohammad
    HajiAghayi, MohammadTaghi
    Seddighin, Masoud
    Seddighin, Saeed
    Yami, Hadi
    ARTIFICIAL INTELLIGENCE, 2022, 303
  • [47] Double implementation in a market for indivisible goods with a price constraint
    Azacis, Helmuts
    GAMES AND ECONOMIC BEHAVIOR, 2008, 62 (01) : 140 - 154
  • [48] Fair allocation of indivisible goods with minimum inequality or minimum envy
    Cornilly, Dries
    Puccetti, Giovanni
    Rueschendorf, Ludger
    Vanduffel, Steven
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 297 (02) : 741 - 752
  • [49] A Procedure for Fair Division of Indivisible, Identical Objects with Entitlements
    Kabbes, Andrew
    Kilgour, D. Marc
    Cressman, Ross
    ADVANCES IN MATHEMATICAL AND COMPUTATIONAL METHODS: ADDRESSING MODERN CHALLENGES OF SCIENCE, TECHNOLOGY, AND SOCIETY, 2011, 1368
  • [50] Computing welfare-Maximizing fair allocations of indivisible goods
    Aziz, Haris
    Huang, Xin
    Mattei, Nicholas
    Segal-Halevi, Erel
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 307 (02) : 773 - 784