is_pmms_fair
def
An 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 of the union of the two bundles.
Statement
def is_pmms_fair {m n : ℕ} (v : Fin n → Finset (Fin m) → ℝ) (σ : Fin m → Fin n) (i : Fin n) : Prop
- 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
- Built on 2
- pairwise_maximin_shareThe 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)).
- bundle_ofUnder an allocation that gives each item x to agent s(x), agent i's bundle is the set of items given to i.
- 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…
- pmms_fair_not_imp_mms_fairOpen problem 4 of arXiv:2502.02815 has a negative answer: for submodular goods with binary marginals and equal entitlements, pairwise MMS…
- 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
/-- Pairwise MMS for agent `i` (arXiv:2502.02815, Def. 11 with F = MMS, equal entitlements): against every other agent `j`, agent `i`'s bundle is worth at least her maximin share of the two bundles `A_i ∪ A_j` split two ways. -/ def is_pmms_fair {m n : ℕ} (v : Fin n → Finset (Fin m) → ℝ) (σ : Fin m → Fin n) (i : Fin n) : Prop := ∀ j, j ≠ i → pairwise_maximin_share (v i) (bundle_of σ i ∪ bundle_of σ j) ≤ v i (bundle_of σ i)