1 citations · 1 across the 8 of their papers we have counts for
6 papers · 1 filter
Envy-free Allocations with Individual Payments
Robert Bredereck, Eva Deltl, Tanmay Inamdar +2
When an envy-free allocation of indivisible goods does not exist, monetary transfers can restore envy-freeness. Existing work on fair division with subsidies, however, typically as…
Reaching Fairness by Reallocating Goods
Robert Bredereck, Eva Deltl, Tanmay Inamdar +3
Fair allocation of indivisible goods has largely been studied under the assumption that no prior allocation exists. Motivated by practical settings with pre-existing (and possibly…
Optimally Selecting Representative Agents from a Metric Space
Benjamin Cookson, Eva Deltl, Yeeseok Oh
This paper studies the problem of proportionally fair clustering, where the goal is to select ``centers'' from a metric space that fairly represent a set of agents who also lie…
Improved Lower Bounds for Proportionally Fair Clustering
Benjamin Cookson, Eva Deltl, Yeeseok Oh
We study proportionally fair clustering, where a set of centers must be chosen from a metric space to represent agents, and no sufficiently large group of agents should be…
Minimizing the Cost of EFx Allocations
Eva Deltl
Ensuring fairness while limiting costs, such as transportation or storage, is an important challenge in resource allocation, yet most work has focused on cost minimization without…
How to Resolve Envy by Adding Goods
Matthias Bentert, Robert Bredereck, Eva Deltl +2
We consider the problem of resolving the envy of a given initial allocation by adding elements from a pool of goods. We give a characterization of the instances where envy can be r…