AFTD Auto-Formalizing Theoretical Domains

borda_bundle_utility

def

For a strict ranking r of m goods (where r 0 is the top-ranked good), the additive Borda utility of a bundle of goods S assigns m - rank(g) points to each good g in S, so the top good has utility m and the worst good has utility 1.

Statement

def borda_bundle_utility (m : ℕ) (r : Fin m ≃ Fin m) (S : Finset (Fin m)) : ℕ
Defined in
A Social Welfare Optimal Sequential Allocation Procedure
Verified
11 Nov 2026
Axioms
none listed
Used by 3
  • round_robin_u_truthIn the alternating Round-Robin picking sequence ABAB...AB of m goods, agent A's truthful Borda utility U_truth when both agents A and B…
  • round_robin_borda_manipulation_gain_nonnegFor every number of goods m and all rankings rA and rB, the real-valued normalized manipulation gain round_robin_borda_manipulation_gain m…
  • round_robin_u_bestIn the alternating Round-Robin picking sequence ABAB...AB of m goods, agent A's best-response Borda utility U_best is the maximum of A's…

Read back from the Lean

borda_bundle_utility m r S defines the utility of a bundle S (a finite subset of Fin m), given a natural number m and a permutation r : Fin m ≃ Fin m, as the sum over all elements g ∈ S of m - (r.symm g : ℕ). Here r.symm is the inverse permutation of r, its value on g is coerced to a natural number (in {0, ..., m - 1}), and subtraction is natural number subtraction.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Additive Borda utility of a bundle of goods under a strict ranking of m goods. -/
def borda_bundle_utility (m : ℕ) (r : Fin m ≃ Fin m) (S : Finset (Fin m)) : ℕ :=
  ∑ g ∈ S, (m - (r.symm g : ℕ))
See it in the graphDiscuss this resultChallenge it