Seminar Details

We study the problem of selecting a representative committee of k agents from a collection of n agents in a common metric space. This problem is related to choosing k facilities in facility location and k-median problems. However, unlike in more traditional facility location where 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 committees we call NORP, which prevents over-representation of any subset of agents.