fse_leftmost
def
The leftmost mechanism: place the facility at the leftmost reported location.
Statement
open Finset in noncomputable def fse_leftmost {n : ℕ} [NeZero n] (x : Fin n → ℝ) : ℝ
- Source
- step towards fse_scaling_oblivious_dictatorship / fse_dictatorship_conjecture_false (dictatorship conjecture of Facility Location Games with Scaling Effects (arXiv:2402.18908v3), Conclusion)
- Verified
- 06 Oct 2026
- Axioms
- none listed
- Used by 10
- fse_leftmost_anonymousThe leftmost mechanism is anonymous.
- fse_leftmost_surjectiveThe leftmost mechanism is surjective onto [0,1] (unanimous profiles).
- fse_leftmost_SP_of_antitoneKey lemma: for every scaling function that is non-negative and non-increasing on [0,1], the leftmost mechanism is strategyproof.
- fse_conjecture_false_qdepRefutation in the model with the scaling function as input. The mechanism fse_F (which receives q) is strategyproof and surjective for…
- fse_leftmost_attainedThe leftmost location is attained by some agent.
- fse_leftmost_mapsToThe leftmost mechanism maps [0,1]^n into [0,1].
- fse_leftmost_leThe leftmost location is at most every agent's location.
- fse_dictatorship_conjecture_falseRefutation of the dictatorship conjecture of arXiv 2402.18908 (Section 8). For every number n ≥ 2 of agents there is a scaling function…
- fse_leftmost_not_dictatorshipWith at least two agents the leftmost mechanism is not a dictatorship.
- fse_FThe q-dependent mechanism used for the refutation in the model where the mechanism also receives the scaling function: the leftmost…
Lean source view module on GitHub
open Finset in /-- The leftmost mechanism: place the facility at the leftmost reported location. -/ noncomputable def fse_leftmost {n : ℕ} [NeZero n] (x : Fin n → ℝ) : ℝ := Finset.univ.inf' Finset.univ_nonempty x