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) …

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 …

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 …

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 …

We give a deterministic polynomial time 2^ O (r)-approximation algorithm for the number of
bases of a given matroid of rank r and the number of common bases of any two matroids of …

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 …

We study the problem of fairly allocating a set of indivisible goods among n agents with
additive valuations. Envy-freeness up to any good (EFX) is arguably the most compelling …

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 …

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 …