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

被引:0
作者
Pascal Lange
Nhan-Tam Nguyen
Jörg Rothe
机构
[1] Heinrich-Heine-Universität Düsseldorf,Institut für Informatik
来源
Annals of Mathematics and Artificial Intelligence | 2020年 / 88卷
关键词
Fair division; Indivisible goods; Social welfare; Computational complexity; 91B32; 68Q17; 68Q25; 68T42;
D O I
暂无
中图分类号
学科分类号
摘要
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
页数:15
相关论文
共 38 条
[1]  
Budish E(2011)The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes Journal of Political Economy 119 1061-1103
[2]  
Chevaleyre Y(2006)Issues in multiagent resource allocation Informatica 30 3-31
[3]  
Dunne P(2008)Multiagent resource allocation in k-additive domains: Preference representation and complexity Ann. Oper. Res. 163 49-62
[4]  
Endriss U(2010)Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality Auton. Agent. Multi-Agent Syst. 20 234-259
[5]  
Lang J(2005)The complexity of contract negotiation Artif. Intell. 164 23-46
[6]  
Lemaître M(2006)Negotiating socially optimal allocations of resources J. Artif. Intell. Res. 25 315-348
[7]  
Maudet N(1987)An efficient algorithm for the “optimal” stable marriage Journal of the ACM 34 532-543
[8]  
Padget J(2014)No agent left behind: Dynamic fair division of multiple resources J. Artif. Intell. Res. 51 579-603
[9]  
Phelps S(2014)Computational complexity and approximability of social welfare optimization in multiagent resource allocation Journal of Autonomous Agents and Multi-Agent Systems 28 256-289
[10]  
Rodríguez-Aguilar J(2013)A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation Ann. Math. Artif. Intell. 68 65-90