3 papers
cs.LG2025
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…
cs.GT2025
Proportional Clustering, the -Plurality Problem, and Metric Distortion
Leon Kellerhals, Jannik Peters
We show that the proportional clustering problem using the Droop quota for is equivalent to the -plurality problem. We also show that the Plurality Veto rule can be used…
cs.LG2023
Proportional Fairness in Clustering: A Social Choice Perspective
Leon Kellerhals, Jannik Peters
We study the proportional clustering problem of Chen et al. [ICML'19] and relate it to the area of multiwinner voting in computational social choice. We show that any clustering sa…