Low Cost, Fair, and Representative Committees in a Metric Space
Christopher Jerrett, Elliot Anshelevich

TL;DR
This paper introduces algorithms for selecting low-cost, fair, and representative committees in metric spaces, satisfying a new fairness axiom called NORP, and demonstrates their effectiveness in minimizing total distances.
Contribution
The paper presents the first algorithms that simultaneously achieve low cost, fairness, and NORP compliance in committee selection within metric spaces.
Findings
Existence of committees that are low-cost, fair, and NORP-compliant.
New algorithms that produce such committees efficiently.
Demonstration of the feasibility of balancing cost and fairness in committee selection.
Abstract
We study the problem of selecting a representative committee of agents from a collection of agents in a common metric space. This problem is related to choosing facilities in facility location and -median problems. However, unlike in more traditional facility location where each agent only cares about the closest selected facility, in the settings we consider each agent desires that all selected committee members are close to them. More precisely, we look at the sum objective, in which the goal is to minimize the total distance from all agents to all members of the chosen committee. We show that it is always possible to find a committee which is both low-cost according to this objective, and also fair according to many existing notions of fairness and proportionality defined for clustering settings. Moreover, we introduce a new desirable axiom for representative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
