is_weighted_propx_chores
def
Weighted PROPX for chores (zero-tolerant): for every agent i and every chore e in her bundle, her cost for the bundle without e is at most s_i times her cost for all chores.
Statement
def is_weighted_propx_chores {m n : ℕ} (c : Fin n → Fin m → ℝ) (s : Fin n → ℝ) (σ : Fin m → Fin n) : Prop
- Defined in
- On the Incompatibility of Weighted PROPX and Pareto Optimality for Indivisible Chores, arXiv:2608.16130 v1, Defs. 2.3-2.4; formalized by the operator (Claude), 2026-10-03
- Verified
- 03 Oct 2026
- Axioms
- none listed
- Built on 2
- additive_valuationThe additive valuation with item values u: a bundle is worth the sum of its items' values.
- bundle_ofUnder an allocation that gives each item x to agent s(x), agent i's bundle is the set of items given to i.
- Used by 5
- wpropx_gadget_to_natWeighted PROPX for natural-number costs cast to the reals with shares num_i/den implies its natural-number version multiplied through by…
- weighted_propx_po_chores_incompatible_three_seventhsFor two agents with shares (3/7, 4/7), six chores and strictly positive additive costs (262,111,258,100,1,103) and (135,75,113,1,43,53),…
- weighted_propx_po_chores_incompatible_nine_twentiethsFor two agents with shares (9/20, 11/20), six chores and strictly positive additive costs (114,222,1,177,64,166) and…
- weighted_propx_po_chores_incompatible_two_fifthsFor two agents with shares (2/5, 3/5), five chores and strictly positive additive costs (38,1,111,72,48) and (31,54,113,40,1), no…
- no_weighted_propx_po_of_nat_checkReduction for kernel checking: if, for natural-number costs C and shares num/den, every allocation that is weighted PROPX (multiplied…
Lean source view module on GitHub
/-- Weighted PROPX for chores (arXiv:2608.16130, Def. 2.3, zero-tolerant version): for every agent `i` and every chore `e` in her bundle, her cost for the bundle without `e` is at most `s i * c i (M)`. Costs are additive (`additive_valuation`), `M = Finset.univ`. -/ def is_weighted_propx_chores {m n : ℕ} (c : Fin n → Fin m → ℝ) (s : Fin n → ℝ) (σ : Fin m → Fin n) : Prop := ∀ i, ∀ e ∈ bundle_of σ i, additive_valuation (c i) (bundle_of σ i \ {e}) ≤ s i * additive_valuation (c i) Finset.univ