We introduce a novel definition for a small set of points being representative of a larger set in a metric space. Given a set (e.g., documents or voters) to represent, and a set of possible representatives, our criterion requires that for any subset comprising a fraction of , the average distance of to their best points in should not be more than a factor compared to their average distance to the best points among all of . This definition is a strengthening of proportional fairness and core fairness, but - different from those notions - requires that large cohesive clusters be represented proportionally to their size.
Since there are instances for which - unless is polynomially large - no solutions exist, we study this notion in a resource augmentation framework, implicitly stating the constraints for a set of size as though its size were only , for . Furthermore, motivated by the application to elections, we mostly focus on the ordinal model, where the algorithm does not learn the actual distances; instead, it learns only for each point in and each candidate pairs which of is closer to . Our main result is that the Expanding Approvals Rule of Aziz and Lee is representative with .
Our results lead to three notable byproducts. First, we show that the Expanding Approvals Rule achieves constant proportional fairness in the ordinal model, giving the first positive result on metric proportional fairness with ordinal information. Second, we show that for the core fairness objective, the Expanding Approvals Rule achieves the same asymptotic tradeoff between resource augmentation and approximation as the recent results of Li et al., which used full knowledge of the metric. Finally, our results imply a very simple single-winner voting rule with metric distortion at most 44.