is_prop1_fair
def
An allocation is PROP1-fair to an agent with valuation v and entitlement w if her bundle A has v(A) >= w v(M), or v(A + g) > w v(M) for some item g outside A, or v(A - c) > w v(M) for some item c in A.
Statement
def is_prop1_fair {m : ℕ} (v : Finset (Fin m) → ℝ) (w : ℝ) (A : 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 2
- mxs_fair_imp_prop1_fair_of_submodularOpen problem 3 of arXiv:2502.02815 has a positive answer: for submodular goods (monotone, v(empty) = 0) and equal entitlements, every…
- aps_fair_not_imp_prop1_fairOpen problem 2 of arXiv:2502.02815 has a negative answer: for additive goods with unequal entitlements, an allocation can give every agent…
Lean source view module on GitHub
/-- PROP1 (arXiv:2502.02815, Def. 5, strict form): the agent's bundle reaches the proportional share `w · v([m])`, or beats it after taking one more item, or after giving one away. -/ def is_prop1_fair {m : ℕ} (v : Finset (Fin m) → ℝ) (w : ℝ) (A : Finset (Fin m)) : Prop := w * v Finset.univ ≤ v A ∨ (∃ g, g ∉ A ∧ w * v Finset.univ < v (insert g A)) ∨ ∃ c ∈ A, w * v Finset.univ < v (A.erase c)