banzhaf_discrepancy
def
The discrepancy of weights w for a target power distribution m: the l1 distance between m and the p-propensity Banzhaf index of (w; q).
Statement
noncomputable def banzhaf_discrepancy {n : ℕ} (m : Fin n → ℝ) (p q : ℝ) (w : Fin n → ℝ) : ℝ
- Defined in
- How Banzhaf Makes a Victor: Curing a Distortion Paradox in Weighted Voting, EC 2026, Secs. 2-3 and 5; formalized by the operator (Claude), 2026-10-03
- Verified
- 03 Oct 2026
- Axioms
- none listed
- Built on 1
- propensity_banzhaf_indexThe p-propensity Banzhaf power index: the power measure normalised to sum to 1.
- Used by 2
- is_optimal_banzhaf_weightsWeights are optimal for the inverse power problem (m, q, beta^p) if they lie in the simplex and minimise the discrepancy over the simplex.
- bz3_discrepancyFor three players and p = q = 1/2, the discrepancy for target (3/10, 7/10, 0) equals the rational discrepancy of the winning pattern.
Lean source view module on GitHub
/-- The discrepancy of weights `w` for target `m` (How Banzhaf Makes a Victor, Sec. 2.3): the `ℓ₁` distance between `m` and the `p`-propensity Banzhaf index of `(w; q)`. -/ noncomputable def banzhaf_discrepancy {n : ℕ} (m : Fin n → ℝ) (p q : ℝ) (w : Fin n → ℝ) : ℝ := ∑ i, |m i - propensity_banzhaf_index p q w i|