SocialChoice.FairDivision.egalitarianWelfare
defimported Lean
Egalitarian welfare: the minimum utility among agents.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open BigOperators in variable {N S : Type*} in noncomputable def SocialChoice.FairDivision.egalitarianWelfare [Fintype N] [Nonempty N] (u : N → S → ℝ) (A : Allocation N S) : ℝ
- Defined in
- EconCSLib, `SocialChoice.FairDivision.egalitarianWelfare`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.SocialChoice.FairDivision.egalitarianWelfare← SocialChoice.FairDivision.egalitarianWelfare (EconCSLib/SocialChoice/FairDivision/Welfare.lean:29): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- SocialChoice.FairDivision.AllocationA fair-division allocation assigns each agent a share.
- Used by 5
- SocialChoice.FairDivision.CardinalInstance.egalitarianWelfareEgalitarian welfare for a cardinal instance.
- SocialChoice.FairDivision.nsmul_egalitarianWelfare_le_utilitarianWelfareWithout division, egalitarian welfare is bounded above by utilitarian welfare multiplied by the number of agents.
- SocialChoice.FairDivision.IsMaxminMaximin optimality: no feasible allocation has larger egalitarian welfare.
- SocialChoice.FairDivision.egalitarianWelfare_leEgalitarian welfare is bounded above by each agent's utility.
- SocialChoice.FairDivision.Indivisible.egalitarianWelfareEgalitarian social welfare: the minimum of all agents' bundle values.
sw_E(A) = min_{i ∈ N} v_i(A_i). Maximizing egalitarian welfare…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open BigOperators in variable {N S : Type*} in /-- Egalitarian welfare: the minimum utility among agents. -/ noncomputable def SocialChoice.FairDivision.egalitarianWelfare [Fintype N] [Nonempty N] (u : N → S → ℝ) (A : Allocation N S) : ℝ := Finset.univ.inf' ⟨Classical.arbitrary N, Finset.mem_univ _⟩ (fun i => u i (A i))