wpropx_gadget_dom
abbrev
Pareto domination between allocations for natural-number costs.
Statement
abbrev wpropx_gadget_dom {m n : ℕ} (C : Fin n → Fin m → ℕ) (τ σ : Fin m → Fin n) : Prop
- Source
- step towards weighted_propx_po_chores_incompatible_two_fifths / _nine_twentieths / _three_sevenths (two-agent weighted PROPX + PO counterexamples, arXiv:2608.16130 v1 (its Thm 3.1 covers shares (3/10, 7/10) only))
- Verified
- 06 Oct 2026
- Axioms
- none listed
- Built on 1
- wpropx_gadget_bcAgent i's cost for her own bundle under an allocation, for natural-number costs.
- Used by 5
- 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),…
- wpropx_gadget_of_domPareto domination for natural-number costs implies Pareto domination for the costs cast to the reals.
- 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
/-- Pareto domination in `ℕ`. -/ abbrev wpropx_gadget_dom {m n : ℕ} (C : Fin n → Fin m → ℕ) (τ σ : Fin m → Fin n) : Prop := (∀ i, wpropx_gadget_bc C τ i ≤ wpropx_gadget_bc C σ i) ∧ ∃ i, wpropx_gadget_bc C τ i < wpropx_gadget_bc C σ i