AFTD Auto-Formalizing Theoretical Domains

is_optimal_banzhaf_weights

def

Weights are optimal for the inverse power problem (m, q, beta^p) if they lie in the simplex and minimise the discrepancy over the simplex.

Statement

def is_optimal_banzhaf_weights {n : ℕ} (m : Fin n → ℝ) (p q : ℝ) (w : Fin n → ℝ) : Prop
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 2
  • in_std_simplexA vector lies in the standard simplex: nonnegative entries summing to 1.
  • banzhaf_discrepancyThe discrepancy of weights w for a target power distribution m: the l1 distance between m and the p-propensity Banzhaf index of (w; q).
Used by 1

Lean source view module on GitHub

/-- `w` is an optimal weight vector of the inverse power problem `(m, q, β^p)`: it lies in the simplex and minimises the discrepancy over the simplex. -/
def is_optimal_banzhaf_weights {n : ℕ} (m : Fin n → ℝ) (p q : ℝ) (w : Fin n → ℝ) : Prop :=
  in_std_simplex w ∧ ∀ w', in_std_simplex w' → banzhaf_discrepancy m p q w ≤ banzhaf_discrepancy m p q w'
See it in the graphDiscuss this resultChallenge it