plurality_veto_inside_count
def
For a profile prof, candidate a and candidate set N, the veto inside count k(N) is the number of voters whose veto down-set below a (the candidates weakly dominated by a in that voter's ranking) is contained in N.
Statement
def plurality_veto_inside_count {V C : Type*} [Fintype V] [Fintype C] [DecidableEq C] (prof : V → LinearOrder C) (a : C) (N : Finset C) : ℕ
- Source
- step towards plurality_veto_core_exact_regularization_threshold
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Built on 1
- coalition_dominated_candidatesFor finite candidate type C with decidable equality, voter type V, an election profile prof : V → LinearOrder C, a candidate a : C, and a…
Lean source view module on GitHub
/-- Number of voters v whose dominated set coalition_dominated_candidates prof a {v} is contained in N. -/ def plurality_veto_inside_count {V C : Type*} [Fintype V] [Fintype C] [DecidableEq C] (prof : V → LinearOrder C) (a : C) (N : Finset C) : ℕ := (Finset.univ.filter (fun v => coalition_dominated_candidates prof a {v} ⊆ N)).card