has_binary_marginals
def
Every marginal value of the set function is 0 or 1.
Statement
def has_binary_marginals {m : ℕ} (v : Finset (Fin m) → ℝ) : 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
- Used by 5
- 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…
- zero_is_matroid_rank_valuationThe constantly zero set function is a matroid-rank valuation.
- 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…
- empty_eq_zero_of_matroid_rank_valuationA matroid-rank valuation evaluates the empty set to 0.
- is_matroid_rank_valuationA set function on a finite set of indivisible goods is a matroid-rank valuation if it evaluates the empty set to 0, is submodular, and has…
Lean source view module on GitHub
/-- Every marginal value is 0 or 1. -/ def has_binary_marginals {m : ℕ} (v : Finset (Fin m) → ℝ) : Prop := ∀ S j, j ∉ S → v (insert j S) = v S ∨ v (insert j S) = v S + 1