Envy freeness is one of the most widely studied notions in fair division. Because envy-free
allocations do not always exist when items are indivisible, several relaxations have been …

We study the problem of approximating maximum Nash social welfare (NSW) when
allocating m indivisible items among n asymmetric agents with submodular valuations. The …

We consider the problem of approximating maximum Nash social welfare (NSW) while
allocating a set of indivisible items to n agents. The NSW is a popular objective that provides …

In this work, we study the maximin share fairness notion (MMS) for allocation of indivisible
goods in the subadditive and fractionally subadditive settings. While previous work refutes …

We conduct a study on the problem of fair allocation of indivisible goods when maximin
share [1] is used as the measure of fairness. Most of the current studies on this notion are …

We consider the problem of maximizing the Nash social welfare when allocating a set G of
indivisible goods to a set N of agents. We study instances, in which all agents have 2-value …

We give the first $ O (1) $-approximation for the weighted Nash Social Welfare problem with
additive valuations. The approximation ratio we obtain is $ e^{1/e}+\epsilon\approx …

We present a constant-factor approximation algorithm for the Nash Social Welfare (NSW)
maximization problem with subadditive valuations accessible via demand queries. More …

In an instance of the weighted Nash Social Welfare problem, we are given a set of m
indivisible items, G, and n agents, A, where each agent i∈ A has a valuation vij≥ 0 for each …

We study the fair and efficient allocation of a set of indivisible goods among agents, where
each good has several copies, and each agent has an additively separable concave …