has_max_marginal_one
def
The subsidy normalisation: every marginal value v(S + e) - v(S) is at most 1, and some marginal value equals 1.
Statement
def has_max_marginal_one {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 3
- 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
/-- The subsidy normalisation: the largest marginal value of any item is exactly 1. -/ def has_max_marginal_one {m : ℕ} (v : Finset (Fin m) → ℝ) : Prop := (∀ S e, v (insert e S) - v S ≤ 1) ∧ ∃ S e, v (insert e S) - v S = 1