AFTD Auto-Formalizing Theoretical Domains

is_connected_po_chores

def

An allocation of chores is Pareto optimal among connected allocations if no connected allocation costs every agent at most as much and some agent strictly less.

Statement

def is_connected_po_chores {m n : ℕ} (c : Fin n → Fin m → ℝ) (σ : Fin m → Fin n) : Prop
Defined in
Connected EF1 Allocations Exist in Discrete Chore Cutting, arXiv:2609.32545 v1, Sec. 2 (chores on a path, connected bundles, EF1) and Sec. 4 (PO); PO among connected allocations, as usual for connected fair division; formalized by the operator (Claude), 2026-10-03
Verified
03 Oct 2026
Axioms
none listed
Built on 3
  • is_connected_allocationAn allocation is connected if every agent's bundle is connected on the path.
  • 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 1

Lean source view module on GitHub

/-- Pareto optimality among connected allocations, for additive costs `c`: no connected allocation costs every agent at most as much and some agent strictly less. -/
def is_connected_po_chores {m n : ℕ} (c : Fin n → Fin m → ℝ) (σ : Fin m → Fin n) : Prop :=
  ¬ ∃ τ, is_connected_allocation τ ∧
    (∀ i, additive_valuation (c i) (bundle_of τ i) ≤ additive_valuation (c i) (bundle_of σ i)) ∧
    ∃ i, additive_valuation (c i) (bundle_of τ i) < additive_valuation (c i) (bundle_of σ i)
See it in the graphDiscuss this resultChallenge it