A Better-than-$e^{1/e}$ Approximation Algorithm for Nash Social Welfare under Additive Valuations

Vignesh Viswanathan

A Better-than-$e^{1/e}$ Approximation Algorithm for Nash Social Welfare under Additive Valuations

Computer Science and Game Theory 2026-07-14 v1 Data Structures and Algorithms

Authors: Vignesh Viswanathan

Abstract

We present an $(e^{1/e} - c)$ -approximation algorithm for maximizing Nash social welfare under additive valuations, for some constant $c > 0$ . This result improves upon the previous best-known approximation factor of $e^{1/e}$ [Barman, Krishnamurthy and Vaish, EC 2018].

Cite

@article{arxiv.2607.13340,
  title  = {A Better-than-$e^{1/e}$ Approximation Algorithm for Nash Social Welfare under Additive Valuations},
  author = {Vignesh Viswanathan},
  journal= {arXiv preprint arXiv:2607.13340},
  year   = {2026}
}