Proportional Representation in Metric Spaces and Low-Distortion Committee Selection

Abstract

We introduce a novel definition for a small setRR ofkk points being representative of a larger set in a metric space. Given a setVV (e.g., documents or voters) to represent, and a setCC of possible representatives, our criterion requires that for any subsetSS comprising aθ\theta fraction of VV, the average distance ofSS to their bestθ⋅k\theta \cdot k points inRR should not be more than a factorγ\gamma compared to their average distance to the bestθ⋅k\theta \cdot k points among all of CC. 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γ\gamma is polynomially large - no solutions exist, we study this notion in a resource augmentation framework, implicitly stating the constraints for a setRR of sizekk as though its size were only k/αk/\alpha, for α>1\alpha > 1. 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 pointvv inVV and each candidate pairsc,c′c, c' which ofc,c′c, c' is closer to vv. Our main result is that the Expanding Approvals Rule of Aziz and Lee is(α,γ)(\alpha, \gamma) representative with γ≤1+6.71⋅αα−1\gamma \leq 1 + 6.71 \cdot \frac{\alpha}{\alpha-1}.

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.

Publication
The 38th Annual AAAI Conference on Artificial Intelligence (AAAI 2024)
Vikram Kher
Vikram Kher
4th-year CS PhD student