AFTD Auto-Formalizing Theoretical Domains

is_connected_allocation

def

An allocation is connected if every agent's bundle is connected on the path.

Statement

def is_connected_allocation {m n : ℕ} (σ : 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 2
  • is_path_connectedA set of items on the path 0, 1, ..., m-1 is connected if it contains every item between two of its items.
  • 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 2
  • is_connected_po_choresAn allocation of chores is Pareto optimal among connected allocations if no connected allocation costs every agent at most as much and…
  • connected_ef1_po_chores_incompatibleFor chores on a path with additive, strictly positive costs, EF1 and Pareto optimality (among connected allocations) can be incompatible:…

Lean source view module on GitHub

/-- Every agent's bundle under `σ` is connected on the path. -/
def is_connected_allocation {m n : ℕ} (σ : Fin m → Fin n) : Prop :=
  ∀ i, is_path_connected (bundle_of σ i)
See it in the graphDiscuss this resultChallenge it