is_monotone_valuation
def
A valuation is monotone and nonnegative: v(∅) ≥ 0 and S ⊆ T implies v(S) ≤ v(T).
Statement
def is_monotone_valuation {m : ℕ} (v : Finset (Fin m) → ℝ) : Prop
- Defined in
- On the Subsidy of Envy-Free Orientations in Graphs, arXiv:2502.13671 v1, Sec. 2; formalized by the operator (Claude), 2026-10-03
- Verified
- 03 Oct 2026
- Axioms
- none listed
- Used by 4
- 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…
- multigraph_orientation_subsidy_not_le_oneFor three agents on a multigraph with monotone valuations, a total subsidy of n - 2 = 1 does not always suffice for an envy-free…
- multigraph_orientation_subsidy_four_agentsThere is a four-agent multigraph with monotone graph valuations, normalised so the largest marginal is 1, in which every envy-free…
- multigraph_orientation_subsidy_three_halvesThere is a three-agent multigraph with monotone graph valuations, normalised so the largest marginal is 1, in which every envy-free…
Lean source view module on GitHub
/-- A monotone valuation into the nonnegative reals: `0 ≤ v ∅` and `S ⊆ T → v S ≤ v T`. -/ def is_monotone_valuation {m : ℕ} (v : Finset (Fin m) → ℝ) : Prop := 0 ≤ v ∅ ∧ ∀ S T, S ⊆ T → v S ≤ v T