4 papers
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…
The Core in Max-Loss Non-Centroid Clustering Can Be Empty
Robert Bredereck, Eva Deltl, Leon Kellerhals +1
We study core stability in non-centroid clustering under the max-loss objective, where each agent's loss is the maximum distance to other members of their cluster. We prove that fo…
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…