AFTD Auto-Formalizing Theoretical Domains

bz3_pattern

def

The winning pattern of the 3-player weighted game (w; 1/2) with strict quota.

Statement

noncomputable def bz3_pattern (w : Fin 3 → ℝ) : Fin 8 → Bool
Source
step towards banzhaf_strict_majority_veto_distortion_ge_five_thirds (veto distortion at strict simple majority, left open in How Banzhaf Makes a Victor, EC 2026, Sec. 5)
Verified
06 Oct 2026
Axioms
none listed
Built on 2
  • wvg_winsA coalition wins in the weighted voting game (w; q) with strict quota if its total weight exceeds q.
  • bz3_coalThe eight coalitions of three players indexed by bit pattern.
Used by 4
  • bz3_measureFor three players and p = q = 1/2, the Banzhaf measure of a player is a quarter of its pivot count.
  • banzhaf_strict_majority_veto_distortion_ge_five_thirdsAt simple majority with strict quota, the Banzhaf index has veto distortion at least 5/3: for target (3/10, 7/10, 0) the weights (1/2,…
  • bz3_props_patternThe winning pattern of a 3-player game with simplex weights and strict quota 1/2 satisfies bz3_props.
  • 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 winning pattern of the 3-player game `(w; 1/2)`. -/
noncomputable def bz3_pattern (w : Fin 3 → ℝ) : Fin 8 → Bool :=
  fun k => decide (wvg_wins w (1 / 2) (bz3_coal k))
See it in the graphDiscuss this resultChallenge it