We study the mechanism design problem of a social planner for locating two facilities on line interval [0, 1], where set n strategic agents report their locations and determines facilities. consider requirement minimum distance 0 ≤ d 1 between Given are heterogeneous, we model cost/utility an agent as sum his distances to both In heterogeneous two-facility location game minimize cost, show that...