We study the problem of allocating indivisible goods among agents with additive valuations in a fair and efficient manner, when agents have few utility values for the goods. We consider …
J Garg, E Husić, LA Végh - Proceedings of the 53rd Annual ACM …, 2021 - dl.acm.org
We consider the problem of approximating maximum Nash social welfare (NSW) while allocating a set of indivisible items to n agents. The NSW is a popular objective that provides …
X Bu, Z Li, S Liu, J Song, B Tao - International Conference on Web and …, 2023 - Springer
We consider the problem of fairly allocating indivisible resources to agents, which has been studied for years. Most previous work focuses on fairness and/or efficiency among agents …
The Nash social welfare (NSW) is a well-known social welfare measurement that balances individual utilities and the overall efficiency. In the context of fair allocation of indivisible …
In this paper we study the problem of finding fair and efficient allocations of a mixed manna, ie, a set M of discrete items that are goods/chores, among a set N of agents with additive …
We study the problem of maximizing Nash welfare (MNW) while allocating indivisible goods to asymmetric agents. The Nash welfare of an allocation is the weighted geometric mean of …
We study the problem of fairly allocating a set of m indivisible chores (items with non-positive value) to n agents. We consider the desirable fairness notion of 1-out-of-d maximin share …
We study fair allocation of indivisible public goods subject to cardinality (budget) constraints. In this model, we have n agents and m available public goods, and we want to select $ k\leq …
We study the fair and efficient allocation of a set of indivisible goods among agents, where each good has several copies, and each agent has an additively separable concave …