SOURCE-LINKED INTELLIGENCE

Optimally Selecting Representative Agents from a Metric Space

arXiv · AI, language, vision and robotics · article · Aug 29, 2026 · UTC

This paper studies the problem of proportionally fair clustering, where the goal is to select $k$ ``centers'' from a metric space that fairly represent a set of agents who also lie in the metric space. Specifically, we focus on finding a clustering satisfying a fairness property known as the Droop core. In the practical special case in which the set of feasible center locations contains every agent location, the previous best-known result guaranteed a $(1 + \sqrt{2})$-approximation of the Droop core, while the best-known lower bound was $2$. In this paper, we show that this lower bound is tigh

Read original source ↗ Open in workspace

recordType

paper

region

Global