AFTD Auto-Formalizing Theoretical Domains

SocialChoice.FairDivision.Indivisible.mmsValue

defimported Lean

The maximin share (MMS) value of agent i with respect to valuation v and good set allGoods. mmsValue v allGoods i = sup_{B : n-partition} inf_{j : N} v_i(B_j). Intuitively: the best (highest) minimum-bundle value agent i can guarantee by proposing a complete n-partition of allGoods. The outer iSup ranges over all complete allocations {B // IsAllocation allGoods B}; the inner iInf ranges over all agent indices j : N (the bundle labels). The corresponding predicate ("did agent i receive at least their MMS value?") is IsMaxminShare in Fairness.lean. See isMaxminShare_iff_isAlphaMMS_one for the connection. If no complete allocation exists (e.g., N = ∅), iSup over the empty subtype yields sSup ∅ = 0 in ℝ. Use [Nonempty N] to ensure a complete allocation exists. [Budish 2011; AGT Ch.11]

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset in
variable {N G : Type*} in
noncomputable def SocialChoice.FairDivision.Indivisible.mmsValue [Fintype N] [DecidableEq G]
    (v : Valuation N G) (allGoods : Finset G) (i : N) : ℝ
Defined in
EconCSLib, `SocialChoice.FairDivision.Indivisible.mmsValue`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 3
Used by 9

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset in
variable {N G : Type*} in
/-- The **maximin share (MMS) value** of agent `i` with respect to valuation `v` and good set `allGoods`. `mmsValue v allGoods i = sup_{B : n-partition} inf_{j : N} v_i(B_j)`. Intuitively: the best (highest) minimum-bundle value agent `i` can guarantee by proposing a complete `n`-partition of `allGoods`. The outer `iSup` ranges over all complete allocations `{B // IsAllocation allGoods B}`; the inner `iInf` ranges over all agent indices `j : N` (the bundle labels). The corresponding **predicate** ("did agent `i` receive at least their MMS value?") is `IsMaxminShare` in `Fairness.lean`. See `isMaxminShare_iff_isAlphaMMS_one` for the connection. If no complete allocation exists (e.g., `N = ∅`), `iSup` over the empty subtype yields `sSup ∅ = 0` in ℝ. Use `[Nonempty N]` to ensure a complete allocation exists. [Budish 2011; AGT Ch.11] -/
noncomputable def SocialChoice.FairDivision.Indivisible.mmsValue [Fintype N] [DecidableEq G]
    (v : Valuation N G) (allGoods : Finset G) (i : N) : ℝ :=
  iSup fun B : {A : Allocation N G // IsAllocation allGoods A} =>
    iInf fun j : N => v.val i (B.val j)
See it in the graphDiscuss this resultChallenge it