SocialChoice.FairDivision.Indivisible.IsAllocation
structureimported Lean
A complete allocation partitions all goods among agents. * disjoint: distinct agents receive disjoint bundles. * complete: every good in allGoods is allocated to some agent. [Fintype N] is required for Finset.univ in the completeness condition. [DecidableEq G] is required for Finset.biUnion and Disjoint. [AGT Ch.11]
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in structure SocialChoice.FairDivision.Indivisible.IsAllocation {N G : Type*} [Fintype N] [DecidableEq G] (allGoods : Finset G) (A : Allocation N G) : Prop
- Defined in
- EconCSLib, `SocialChoice.FairDivision.Indivisible.IsAllocation`
- 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.Indivisible.IsAllocation← SocialChoice.FairDivision.Indivisible.IsAllocation (EconCSLib/SocialChoice/FairDivision/Indivisible/Basic.lean:55): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- SocialChoice.FairDivision.Indivisible.AllocationAn allocation assigns each agent
i : Na bundle (a finite subset of goodsG). This is a plain function type alias. The partition…
- SocialChoice.FairDivision.Indivisible.AllocationAn allocation assigns each agent
- Used by 13
- SocialChoice.FairDivision.Indivisible.not_paretoImproved_selfThe allocation itself is not a Pareto improvement over itself.
- SocialChoice.FairDivision.Indivisible.mmsValue_nonnegFor nonneg valuations with at least one complete allocation, the MMS value is nonneg.
hneensures theiSupis nonempty.[Fintype G]… - SocialChoice.FairDivision.Indivisible.isMaxminShare_iff_isAlphaMMS_one
IsMaxminSharefromFairness.leancoincides withIsAlphaMMS 1. → direction (IsMaxminShare → IsAlphaMMS 1): for every complete… - SocialChoice.FairDivision.Indivisible.mmsValue_le_proportional_share_additiveFor additive valuations, the MMS value is at most the proportional share:
n * mmsValue ≤ v_i(allGoods). *Proof*: For any completeB,… - SocialChoice.FairDivision.Indivisible.IsUtilitarianOptimalUtilitarian optimal: no complete allocation of
allGoodsachieves strictly higher utilitarian (sum) social welfare.… - SocialChoice.FairDivision.Indivisible.IsMaxminShare.isAlphaMMS
IsMaxminShareimplies α-MMS forα ≤ 1and nonneg MMS values. - SocialChoice.FairDivision.Indivisible.mkAlloc_isAllocationSocialChoice.FairDivision.Indivisible.mkAlloc_isAllocation
- SocialChoice.FairDivision.Indivisible.IsParetoOptimalAn allocation
Ais Pareto optimal if no complete allocationBweakly improves every agent's bundle value and strictly improves at… - SocialChoice.FairDivision.Indivisible.mmsValue_le_of_forallThe MMS value is at most any upper bound on all per-allocation minimum bundle values. If
ubis an upper bound — for every complete… - SocialChoice.FairDivision.Indivisible.IsMaxminShareMaximin share (MMS) guarantee: each agent's bundle is at least as valuable as their maximin share value — the best worst-piece they could…
- SocialChoice.FairDivision.Indivisible.mmsValueThe maximin share (MMS) value of agent
iwith respect to valuationvand good setallGoods.… - SocialChoice.FairDivision.Indivisible.iInf_partition_le_mmsValueThe min-bundle value of any complete allocation is at most the MMS value. For any complete allocation
B:… - SocialChoice.FairDivision.Indivisible.IsMaxminMaximin (egalitarian) optimal: no complete allocation of
allGoodsachieves higher egalitarian (minimum-agent) welfare. A maximin…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset in /-- A complete allocation partitions all goods among agents. * `disjoint`: distinct agents receive disjoint bundles. * `complete`: every good in `allGoods` is allocated to some agent. `[Fintype N]` is required for `Finset.univ` in the completeness condition. `[DecidableEq G]` is required for `Finset.biUnion` and `Disjoint`. [AGT Ch.11] -/ structure SocialChoice.FairDivision.Indivisible.IsAllocation {N G : Type*} [Fintype N] [DecidableEq G] (allGoods : Finset G) (A : Allocation N G) : Prop where /-- Distinct agents receive disjoint bundles. -/ disjoint : ∀ i j : N, i ≠ j → Disjoint (A i) (A j) /-- Every good in `allGoods` is allocated to some agent. -/ complete : allGoods = Finset.univ.biUnion A