AFTD Auto-Formalizing Theoretical Domains

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

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
See it in the graphDiscuss this resultChallenge it