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 distributing a set of indivisible goods among agents with additive
valuations in a fair manner. The fairness notion under consideration is envy-freeness up to …

We consider the classic problem of fairly allocating indivisible goods among agents with
additive valuation functions and explore the connection between two prominent fairness …

Wherever there is group life, there has been a social division of labor and resource
allocation, since ancient times. Examples include ant colonies, bee colonies, and wolf …

We consider the problem of allocating a set of divisible goods to N agents in an online
manner, aiming to maximize the Nash social welfare, a widely studied objective which …

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 …

Fair division of indivisible goods is a central challenge in artificial intelligence. For many
prominent fairness criteria including envy-freeness (EF) or proportionality (PROP), no …

A constant-factor approximation algorithm for Nash Social Welfare with submodular valuations
Page 1 A constant-factor approximation algorithm for Nash Social Welfare with submodular …

We study the problem of allocating a set of indivisible goods among agents with subadditive
valuations in a fair and efficient manner. Envy-Freeness up to any good (EFX) is the most …

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 …