two_facility_social_cost
def
SC(c) = sum over agents i of cost_i(c).
Statement
noncomputable def two_facility_social_cost {ι X : Type*} [Fintype ι] [MetricSpace X] (x : ι → X) (p : ι → Fin 2 → Bool) (c : Fin 2 → X) : ℝ
- Defined in
- arXiv:2610.18006 (Truthful two-facility location with candidate locations in metric spaces), Sec. 2, social cost
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Built on 1
- two_facility_costcost_i(c) = sum over j in {F_1, F_2} of p_ij * d(x_i, c_j).
- Used by 4
- fixed_dictator_social_cost_le_of_doubletonCase 1 of Theorem 4.5: if the facilities are at the two closest candidate locations w_1, w_2 of an agent i approving both, then SC(w) ≤…
- fixed_dictator_social_cost_le_of_one_approvedCase 3 of Theorem 4.5: when only F_k is approved and it is placed at a closest candidate of an approving agent i (the other facility at…
- fixed_dictator_social_cost_leOn a general metric space, for n ≥ 2 agents with known non-empty approval preferences over two facilities and any candidate set C, every…
- fixed_dictator_social_cost_le_of_singletonsCase 2 of Theorem 4.5: with no agent approving both facilities, if F_1 is at a closest candidate w_1 of an agent i approving F_1 and F_2…
Lean source view module on GitHub
/-- Social cost: the sum of the individual costs. -/ noncomputable def two_facility_social_cost {ι X : Type*} [Fintype ι] [MetricSpace X] (x : ι → X) (p : ι → Fin 2 → Bool) (c : Fin 2 → X) : ℝ := ∑ i, two_facility_cost x p i c