AFTD Auto-Formalizing Theoretical Domains

is_pareto_optimal_chores

def

An allocation of chores is Pareto optimal if no allocation Pareto-dominates it.

Statement

def is_pareto_optimal_chores {m n : ℕ} (c : Fin n → Fin m → ℝ) (σ : 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 1
  • pareto_dominates_choresAn allocation of chores Pareto-dominates another if it costs every agent at most as much and some agent strictly less.
Used by 4

Lean source view module on GitHub

/-- Pareto optimality for chores (arXiv:2608.16130, Def. 2.4): no (integral) allocation Pareto-dominates `σ`. -/
def is_pareto_optimal_chores {m n : ℕ} (c : Fin n → Fin m → ℝ) (σ : Fin m → Fin n) : Prop :=
  ¬ ∃ τ, pareto_dominates_chores c τ σ
See it in the graphDiscuss this resultChallenge it