English

APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items

Computational Complexity 2015-07-07 v1 Data Structures and Algorithms Computer Science and Game Theory
Authors: Euiwoong Lee
View on arXiv ↗ PDF ↗

Abstract

We study the problem of allocating a set of indivisible items to agents with additive utilities to maximize the Nash social welfare. Cole and Gkatzelis recently proved that this problem admits a constant factor approximation. We complement their result by showing that this problem is APX-hard.

Keywords

Nash social welfare indivisible items APX-hardness approximation algorithms fair division

Cite

@article{arxiv.1507.01159,
  title  = {APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items},
  author = {Euiwoong Lee},
  journal= {arXiv preprint arXiv:1507.01159},
  year   = {2015}
}

Comments

6 pages

Related papers

View all related →
Computer Science and Game Theory · Computer Science
NP-Hardness of Approximating Nash Social Welfare with Supermodular Valuations
Alon Bebchuk
2025-10-31
Computer Science and Game Theory · Computer Science
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
Nima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani
2017-04-10
Computer Science and Game Theory · Computer Science
Maximizing Nash Social Welfare in 2-Value Instances
Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn +5
2021-10-04
Computer Science and Game Theory · Computer Science
Greedy Algorithms for Maximizing Nash Social Welfare
Siddharth Barman, Sanath Kumar Krishnamurthy, Rohit Vaish
2018-07-23
Computer Science and Game Theory · Computer Science
EFx Budget-Feasible Allocations with High Nash Welfare
Marius Garbea, Vasilis Gkatzelis, Xizhi Tan
2023-08-04
Data Structures and Algorithms · Computer Science
An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations
Asei Inoue, Yusuke Kobayashi
2022-01-06
Computer Science and Game Theory · Computer Science
Approximating Nash Social Welfare under Binary XOS and Binary Subadditive Valuations
Siddharth Barman, Paritosh Verma
2021-10-27
Computer Science and Game Theory · Computer Science
On the Hardness of Fair Allocation under Ternary Valuations
Zack Fitzsimmons, Vignesh Viswanathan, Yair Zick
2024-11-01
Data Structures and Algorithms · Computer Science
On Fair Division of Indivisible Items
Bhaskar Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg +2
2019-05-13
Computer Science and Game Theory · Computer Science
Nash Social Welfare for 2-value Instances
Hannaneh Akrami, Bhaskar Ray Chaudhury, Kurt Mehlhorn, Golnoosh Shahkarami +1
2021-10-13
Data Structures and Algorithms · Computer Science
Approximations for Allocating Indivisible Items with Concave-Additive Valuations
Nathaniel Kell, Kevin Sun
2022-03-15
Computer Science and Game Theory · Computer Science
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
Jugal Garg, Pooja Kulkarni, Rucha Kulkarni
2020-01-01
Computer Science and Game Theory · Computer Science
Approximating One-Sided and Two-Sided Nash Social Welfare With Capacities
Salil Gokhale, Harshul Sagar, Rohit Vaish, Vignesh Viswanathan +1
2025-05-19
Computer Science and Game Theory · Computer Science
Maximizing social welfare among EF1 allocations at the presence of two types of agents
Jiaxuan Ma, Yong Chen, Guangting Chen, Mingyang Gong +2
2025-09-12
Computer Science and Game Theory · Computer Science
Improved Hardness Results for Nash Social Welfare, Budgeted Allocation and GAP via the Unique Games Conjecture
Vignesh Viswanathan
2026-05-27
Computer Science and Game Theory · Computer Science
Maximizing Nash Social Welfare in 2-Value Instances: Delineating Tractability
Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer, Kurt Mehlhorn +5
2026-02-23
Computer Science and Game Theory · Computer Science
Nash Welfare Guarantees for Fair and Efficient Coverage
Siddharth Barman, Anand Krishna, Y. Narahari, Soumyarup Sadhukhan
2022-07-06
Data Structures and Algorithms · Computer Science
Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
Adam Brown, Aditi Laddha, Madhusudhan Reddy Pittu, Mohit Singh
2024-01-08
Computer Science and Game Theory · Computer Science
Computing Welfare-Maximizing Fair Allocations of Indivisible Goods
Haris Aziz, Xin Huang, Nicholas Mattei, Erel Segal-Halevi
2024-09-23
Computer Science and Game Theory · Computer Science
Fair and Efficient Allocations under Subadditive Valuations
Bhaskar Ray Chaudhury, Jugal Garg, Ruta Mehta
2020-08-18
Computer Science and Game Theory · Computer Science
Maximizing Nash Social Welfare in 2-Value Instances: A Simpler Proof for the Half-Integer Case
Kurt Mehlhorn
2026-02-23
Computer Science and Game Theory · Computer Science
Uniform Welfare Guarantees Under Identical Subadditive Valuations
Siddharth Barman, Ranjani G. Sundaram
2020-05-04
Computer Science and Game Theory · Computer Science
Approximating Nash Social Welfare under Rado Valuations
Jugal Garg, Edin Husic, Laszlo A. Vegh
2020-10-02
Computer Science and Game Theory · Computer Science
Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
Yasushi Kawase, Koichi Nishimura, Hanna Sumita
2024-07-10
Computer Science and Game Theory · Computer Science
The Fairness of Maximum Nash Social Welfare Under Matroid Constraints and Beyond
Yuanyuan Wang, Xin Chen, Qingqin Nong
2024-11-07