Budget-feasible Maximum Nash Social Welfare is Almost Envy-free

The Nash social welfare (NSW) is a well-known social welfare measurement that balances individual utilities and the overall efficiency. In the context of fair allocation of indivisible goods, it has been shown by Caragiannis et al. (EC 2016 and TEAC 2019) that an allocation maximizing the NSW is envy-free up to one good (EF1). In this paper, we are interested in the fairness of the NSW in a budget-feasible allocation problem, in which each item has a cost that will be incurred to the agent it is allocated to, and each agent has a budget constraint on the total cost of items she receives. We show that a budget-feasible allocation that maximizes the NSW achieves a 1/4-approximation of EF1 and the approximation ratio is tight. The approximation ratio improves gracefully when the items have small costs compared with the agents’ budgets; it converges to 1/2 when the budget-cost ratio approaches infinity.

[1]  Rohit Vaish,et al.  Finding Fair and Efficient Allocations , 2017, EC.

[2]  J. Nash.  THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[3]  Kurt Mehlhorn,et al.  A Little Charity Guarantees Almost Envy-Freeness , 2019, SODA.

[4]  Alexandros Hollender,et al.  Maximum Nash Welfare and Other Stories About EFX , 2020, IJCAI.

[5]  Joachim Schauer,et al.  Maximizing Nash Product Social Welfare in Allocating Indivisible Goods , 2014, Eur. J. Oper. Res..

[6]  Siddharth Barman,et al.  Fair Division Under Cardinality Constraints , 2018, IJCAI.

[7]  Nikhil R. Devanur,et al.  Convex Program Duality, Fisher Markets, and Nash Social Welfare , 2016, EC.

[8]  Simina Brânzei,et al.  Nash Social Welfare Approximation for Strategic Agents , 2016, EC.

[9]  Ariel D. Procaccia,et al.  The Unreasonable Fairness of Maximum Nash Welfare , 2016, EC.

[10]  R. Ravi,et al.  The Geometry of Online Packing Linear Programs , 2012, Math. Oper. Res..

[11]  Euiwoong Lee,et al.  APX-hardness of maximizing Nash social welfare with indivisible items , 2015, Inf. Process. Lett..

[12]  M. Kaneko,et al.  The Nash Social Welfare Function , 1979 .

[13]  Kamesh Munagala,et al.  Fair Allocation of Indivisible Public Goods , 2018, EC.

[14]  Jörg Rothe,et al.  Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods , 2014, Discret. Appl. Math..

[15]  Richard Cole,et al.  Approximating the Nash Social Welfare with Indivisible Items , 2018, SIAM J. Comput..

[16]  Berthold Vöcking,et al.  Primal beats dual on online packing LPs in the random-order model , 2013, STOC.

[17]  Jugal Garg,et al.  Improving Nash Social Welfare Approximations , 2019, IJCAI.

[18]  Nikhil R. Devanur,et al.  Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.

[19]  Xin Huang,et al.  Envy-Freeness Up to Any Item with High Nash Welfare: The Virtue of Donating Items , 2019, EC.

[20]  Jiarui Gan,et al.  Budget-feasible Maximum Nash Social Welfare Allocation is Almost Envy-free , 2020, ArXiv.

[21]  Jörg Rothe,et al.  Computational complexity and approximability of social welfare optimization in multiagent resource allocation , 2012, Autonomous Agents and Multi-Agent Systems.

[22]  Vincent Conitzer,et al.  Fair Public Decision Making , 2016, EC.

[23]  Jon Feldman,et al.  Online Stochastic Packing Applied to Display Ad Allocation , 2010, ESA.

[24]  Ulrich Endriss,et al.  Nash Social Welfare in Multiagent Resource Allocation , 2009, AMEC/TADA.