AFTD Auto-Formalizing Theoretical Domains

is_hare_monroe_committee

def

W is a winning committee of the (Hare) Monroe rule: some Hare-valid assignment for W has Monroe score at least that of every Hare-valid assignment of every size-k committee.

Statement

def is_hare_monroe_committee {n m : ℕ} (A : Fin n → Finset (Fin m)) (k : ℕ)
    (W : Finset (Fin m)) : Prop
Defined in
Justified Representation: From Hare to Droop, arXiv:2508.00811, Def. 16 (Monroe rule, Hare quota)
Verified
06 Oct 2026
Axioms
none listed
Built on 2
  • is_hare_valid_assignmentA Hare-valid Monroe assignment (arXiv:2508.00811, Def. 16): W has k members, π sends every voter into W, and every c ∈ W receives between…
  • monroe_scoreThe Monroe score of an assignment π: the number of voters i with π(i) ∈ A_i.
Used by 1
  • hare_monroe_satisfies_droop_jrEvery committee selected by the (Hare) Monroe rule satisfies Droop-JR, for all n and k. This answers the open question of Justified…

Lean source view module on GitHub

/-- `W` is a winning committee of the (Hare) Monroe rule for approval ballots `A`. -/
def is_hare_monroe_committee {n m : ℕ} (A : Fin n → Finset (Fin m)) (k : ℕ)
    (W : Finset (Fin m)) : Prop :=
  ∃ π, is_hare_valid_assignment k W π ∧
    ∀ W' π', is_hare_valid_assignment k W' π' → monroe_score A π' ≤ monroe_score A π
See it in the graphDiscuss this resultChallenge it