… of allocating a set of indivisible items among agents with … Nash social welfare. This problem
is known to be NPhard, and our main result is the first efficient constant-factor approximation …

… of allocating a set of indivisible items among agents with … Nash social welfare. This problem
is known to be NP-hard, and our main result is the first efficient constant-factor approximation …

… Nash welfare can no longer be directly expressed as the inner product between two real stable
polynomials. We show that an approximation … ] to maximize this approximate expectation. …

… We study the problem of allocating a set of indivisible items … ’ valuations, ie, the Nash social
welfare. This problem is known … work, the Nash social welfare (also known as Bernoulli-Nash …

… the number of goods to be distributed. In addition, we study the problem of maximizing social
welfare by the average Nash product. We provide a fast greedy approximation algorithm for …

… Additional Key Words and Phrases: Nash Social Welfare, Submodular Valuations, …
approximating the maximum Nash social welfare (NSW) when allocating a set G of indivisible …

… indivisible goods among agents with additive valuations. The extent of fairness of an allocation
is measured by its Nash social welfare… -approximation to the optimal Nash social welfare (…

… indivisible goods among n agents. Various fairness notions have been proposed within the
rapidly growing field of fair division, but the Nash social welfare (… factor approximation to max …

… of approximating maximum Nash social welfare (NSW) while allocating a set of indivisible
items to n … , the first constantfactor approximation algorithm was obtained in 2015. Subsequent …

… Approximating the Nash social welfare with indivisible items. In Proceedings of the forty-seventh …
Convex program duality, Fisher markets, and Nash social welfare. In Proceedings of the …