Abstract
In this letter we briefly discuss our main result from [Cole and Gkatzelis 2015]. Given a set of indivisible items and a set of agents having additive valuations, our goal is to allocate the items to the agents in order to maximize the geometric mean of the agents' valuations, i.e., the Nash social welfare. This problem is known to be NP-hard, and our main result is the first efficient constant-factor approximation algorithm for this objective.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have