
Approximating Nash Social Welfare in 2Valued Instances
We consider the problem of maximizing the Nash social welfare when alloc...
read it

Approximating Nash Social Welfare under Binary XOS and Binary Subadditive Valuations
We study the problem of allocating indivisible goods among agents in a f...
read it

Greedy Algorithms for Maximizing Nash Social Welfare
We study the problem of fairly allocating a set of indivisible goods amo...
read it

Tight Approximation Algorithms for pMean Welfare Under Subadditive Valuations
We develop polynomialtime algorithms for the fair and efficient allocat...
read it

Almost Envyfreeness, Envyrank, and Nash Social Welfare Matchings
Envyfree up to one good (EF1) and envyfree up to any good (EFX) are tw...
read it

Uniform Welfare Guarantees Under Identical Subadditive Valuations
We study the problem of allocating indivisible goods among agents that h...
read it

On Fair Division of Indivisible Items
We consider the task of assigning indivisible goods to a set of agents i...
read it
Nash Social Welfare for 2value Instances
We study the problem of allocating a set of indivisible goods among agents with 2value additive valuations. Our goal is to find an allocation with maximum Nash social welfare, i.e., the geometric mean of the valuations of the agents. We give a polynomialtime algorithm to find a Nash social welfare maximizing allocation when the valuation functions are integrally 2valued, i.e., each agent has a value either 1 or p for each good, for some positive integer p. We then extend our algorithm to find a better approximation factor for general 2value instances.
READ FULL TEXT
Comments
There are no comments yet.