Scalable Fair Division for 'At Most One' Preferences

Understand

Allocating multiple scarce items across a set of individuals is an important practical problem.

• In the case of divisible goods and additive preferences a convex program can be used to find the solution that maximizes Nash welfare (MNW).
• The MNW solution is equivalent to finding the equilibrium of a market economy (aka.
• the competitive equilibrium from equal incomes, CEEI) and thus has good properties such as Pareto optimality, envy-freeness, and incentive compatibility in the large.