AFTD Auto-Formalizing Theoretical Domains

two_agent_first_best_welfare

def

The first-best utilitarian welfare for two agents over m goods, defined as the sum over all goods of the maximum value assigned by either agent.

Statement

noncomputable def two_agent_first_best_welfare (m : ℕ) (v : Fin 2 → Fin m → ℝ) : ℝ
Defined in
Kalinowski et al., IJCAI 2013
Verified
11 Nov 2026
Axioms
none listed
Used by 2
  • two_agent_welfare_regret_nonnegFor any number of goods m : ℕ, any drafting schedule s : Fin m → Fin 2 of length m, and any nonnegative valuation profile v : Fin 2 → Fin…
  • two_agent_welfare_regretGiven a number of goods m : ℕ, a drafting schedule s : Fin m → Fin 2 of length m, and valuations v : Fin 2 → Fin m → ℝ, the utilitarian…

Read back from the Lean

Given a natural number m and a function v : Fin 2 → Fin m → ℝ (representing the valuations of two agents across m items), two_agent_first_best_welfare m v is defined as the real number ∑_{g : Fin m} max (v 0 g) (v 1 g), the sum over all items g in Fin m of the maximum of agent 0's valuation v 0 g and agent 1's valuation v 1 g.

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

/-- The first-best optimal utilitarian welfare allocating each good to the agent who values it most. -/
noncomputable def two_agent_first_best_welfare (m : ℕ) (v : Fin 2 → Fin m → ℝ) : ℝ :=
  ∑ g : Fin m, max (v 0 g) (v 1 g)
See it in the graphDiscuss this resultChallenge it