Fair division, a key concern in the design of many social institutions, has for 70 years been
the subject of interdisciplinary research at the interface of mathematics, economics, and …

The maximum Nash welfare (MNW) solution—which selects an allocation that maximizes
the product of utilities—is known to provide outstanding fairness guarantees when allocating …

We study the problem of allocating a set of indivisible goods among a set of agents in a fair
and efficient manner. An allocation is said to be fair if it is envy-free up to one good (EF1) …

The fair division of indivisible goods is a very well-studied problem. The goal of this problem
is to distribute m goods to n agents in a “fair” manner, where every agent has a valuation for …

The main focus of this paper is on the problem of maximizing the Nash social welfare (NSW).
In particular, given a collection of indivisible goods that needs to be allocated to a set of …

We generalize the classic problem of fairly allocating indivisible goods to the problem of fair
public decision making, in which a decision must be made on several social issues …

Several fairness concepts have been proposed recently in attempts to approximate envy-
freeness in settings with indivisible goods. Among them, the concept of envy-freeness up to …

Fair division problems have attracted the attention of various scientific disciplines in the last
decades, including among others, mathematics, economics, computer science, and political …

We consider the problem of fairly allocating indivisible public goods. We model the public
goods as elements with feasibility constraints on what subsets of elements can be chosen …

A mixed manna contains goods (that everyone likes) and bads (that everyone dislikes), as
well as items that are goods to some agents, but bads or satiated to others. If all items are …