Allocating resources to individuals in a fair manner has been a topic of interest since ancient
times, with most of the early mathematical work on the problem focusing on resources that …

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 present a constant-factor approximation algorithm for the Nash Social Welfare (NSW)
maximization problem with subadditive valuations accessible via demand queries. More …

Allocating resources to individuals in a fair manner has been a topic of interest since ancient
times, with most of the early mathematical work on the problem focusing on resources that …

The maximum Nash social welfare (NSW)---which maximizes the geometric mean of agents'
utilities---is a fundamental solution concept with remarkable fairness and efficiency …

We consider a novel setting where a set of items is matched to the same set of agents
repeatedly over multiple rounds. Each agent gets exactly one item per round, which brings …

We study incentive-compatible mechanisms that maximize the Nash Social Welfare. Since
traditional incentive-compatible mechanisms cannot maximize the Nash Social Welfare …

For any> 0, we give a simple, deterministic (4+)-approximation algorithm for the Nash social
welfare (NSW) problem under submodular valuations. The previous best approximation …

The Nash social welfare (NSW) problem is relevant not only to the economic domain but
also extends its applicability to the field of computer science. However, maximizing Nash …

The past few years have seen a surge of work on fairness in allocation problems where
items must be fairly divided among agents having individual preferences. In comparison …