On Fair Division of Indivisible Items
arXiv: Data Structures and Algorithms, Volume abs/1805.06232, 2018.
We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion of fairness is Nash social welfare, i.e., the goal is to maximize the geometric mean of the utilities of the agents. Each good comes in multiple items or copies, and the utility of an agent diminishes as it receives more items of the same g...More
PPT (Upload PPT)