IsClosestCandidate
def
c ∈ C and d(y, c) ≤ d(y, c') for every c' ∈ C.
Statement
def IsClosestCandidate {X : Type*} [MetricSpace X] (C : Finset X) (y c : X) : Prop
- Source
- helper notion for the closest candidate location t(i) of arXiv:2610.18006 (Truthful two-facility location with candidate locations in metric spaces), Sec. 2
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Used by 10
- 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_max_cost_le_of_doubletonIn the two-facility location problem on a general metric space with candidate set C and a finite nonempty set of agents, if an agent i…
- fixed_dictator_max_cost_leOn general metric spaces, in the two-facility location problem with candidate locations C and a finite nonempty set of n ≥ 2 agents with…
- is_two_facility_feasible_of_is_fixed_dictator_outputSanity: every Fixed-Dictator output is a feasible solution (two distinct candidate locations).
- IsFixedDictatorOutputw is an outcome of Fixed-Dictator (Mechanism 2 of arXiv:2610.18006) for some fixed agents and some tie-breaking, the three cases being: a…
- 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…
- fixed_dictator_max_cost_le_of_singletonsIn the two-facility location problem on a metric space with a finite nonempty set of agents, if no agent approves both facilities, agent i…
- fixed_dictator_max_cost_le_of_one_approvedIn the two-facility location problem on a general metric space with candidate set C and a finite nonempty set of agents, if no agent…
Lean source view module on GitHub
/-- `c` is a closest point of the finite set `C` to `y` (ties allowed). -/ def IsClosestCandidate {X : Type*} [MetricSpace X] (C : Finset X) (y c : X) : Prop := c ∈ C ∧ ∀ c' ∈ C, dist y c ≤ dist y c'