mms_threshold_monotone
def
μ(n): the largest m such that every instance with n agents, at most m goods and monotone valuations has an MMS allocation.
Statement
noncomputable def mms_threshold_monotone (n : ℕ) : ℕ
- Defined in
- arXiv:2610.06125 (On MMS allocations with few items), Sec. 1 (definition of μ(n)); `sSup` convention for the unbounded case n = 1 added
- Verified
- 06 Oct 2026
- Axioms
- none listed
- Built on 1
- mms_exists_monotoneEvery instance with n agents and m goods, in which every agent has a monotone valuation v_i with v_i(∅) = 0, has an MMS allocation: an…
- Used by 1
- mms_threshold_monotone_twoμ(2) = 3 for monotone valuations over goods: every instance with two agents and at most three goods has an MMS allocation, and some…
Lean source view module on GitHub
/-- The threshold `μ(n)` of arXiv:2610.06125 for monotone valuations over goods: the largest `m` such that every instance with `n` agents and at most `m` goods has an MMS allocation. As an `sSup` in `ℕ` it is `0` when no largest such `m` exists; this happens only for `n = 1` (for `n ≥ 2` the set is bounded by the paper's Theorem 6, and for `n = 0` it is `{0}`). -/ noncomputable def mms_threshold_monotone (n : ℕ) : ℕ := sSup {m | ∀ m' ≤ m, mms_exists_monotone n m'}