  We consider a single-facility location problem, where agents are positioned
on the real line and are partitioned into multiple disjoint districts. The goal
is to choose a location (where a public facility is to be built) so as to
minimize the total distance of the agents from it. This process is distributed:
the positions of the agents in each district are first aggregated into a
representative location for the district, and then one of the district
representatives is chosen as the facility location. This indirect access to the
positions of the agents inevitably leads to inefficiency, which is captured by
the notion of distortion. We study the discrete version of the problem, where
the set of alternative locations is finite, as well as the continuous one,
where every point of the line is an alternative, and paint an almost complete
picture of the distortion landscape of both general and strategyproof
distributed mechanisms.
