AFTD Auto-Formalizing Theoretical Domains

pairwise_maximin_share

def

The maximin share of a valuation when the items U are split into two bundles: the maximum over T inside U of min(v(T), v(U - T)).

Statement

noncomputable def pairwise_maximin_share {m : ℕ} (v : Finset (Fin m) → ℝ)
    (U : Finset (Fin m)) : ℝ
Defined in
Exploring Relations among Fairness Notions in Discrete Fair Division, arXiv:2502.02815 v3, Defs. 5, 7, 8, 11; formalized by the operator (Claude), 2026-10-02
Verified
02 Oct 2026
Axioms
none listed
Used by 3
  • complete_pmms_matroid_rank_sharp_mms_factorFor every integer n ≥ 2, every finite set of m indivisible goods, every profile of matroid-rank valuations v_1, ..., v_n on the goods, and…
  • is_pmms_fairAn allocation is pairwise-MMS-fair to agent i if, for every other agent j, i's bundle is worth to i at least i's two-agent maximin share…
  • pmms_matroid_rank_mms_factor_two_agentsFor two agents with matroid-rank valuations, every complete pairwise maximin-share fair allocation gives each agent at least 1/(2-1) = 1…

Lean source view module on GitHub

/-- The maximin share of a valuation when the items `U` are split between two agents: the share an agent has in the instance restricted to two bundles (arXiv:2502.02815, Def. 11). -/
noncomputable def pairwise_maximin_share {m : ℕ} (v : Finset (Fin m) → ℝ)
    (U : Finset (Fin m)) : ℝ :=
  ⨆ T : {T : Finset (Fin m) // T ⊆ U}, min (v T) (v (U \ T))
See it in the graphDiscuss this resultChallenge it