AFTD Auto-Formalizing Theoretical Domains

draft_rule

def

Given types Agent and Object with decidable equality and finite Object, an implicit natural number T, a picking sequence s : Fin T -> Agent, and a preference profile succ : Agent -> LinearOrder Object, draft_rule s succ defines the allocation Agent -> Finset Object computed by running draft_alloc starting with Finset.univ and the list of agents List.ofFn s.

Statement

def draft_rule {Agent Object : Type*} [DecidableEq Agent] [DecidableEq Object] [Fintype Object]
    {T : ℕ} (s : Fin T → Agent) (succ : Agent → LinearOrder Object) :
    Agent → Finset Object
Defined in
arXiv:2611.09685 Section 4.1
Verified
09 Nov 2026
Axioms
none listed
Built on 1
  • draft_allocGiven a preference profile assigning each agent a linear order on objects, a list of agents representing the turn order, and a finite set…
Used by 4
  • balanced_draft_normalized_utility_boundsIf an agent assigns nonnegative values to all goods, her normalized utility under any schedule lies between zero and the number of agents,…
  • two_agent_draft_welfareGiven a number of goods m : ℕ, a drafting schedule s : Fin m → Fin 2 of length m, and a valuation profile v : Fin 2 → Fin m → ℝ, the…
  • balanced_draft_normalized_utilityFor a schedule and a real valuation profile, multiply an agent's sincere-draft bundle value by the number of agents and divide by her…
  • two_agent_welfare_regret_nonnegFor any number of goods m : ℕ, any drafting schedule s : Fin m → Fin 2 of length m, and any nonnegative valuation profile v : Fin 2 → Fin…

Read back from the Lean

Given types Agent and Object with decidable equality, where Object is finite, a length T : ℕ, a sequence of turns s : Fin T → Agent, and a preference profile succ : Agent → LinearOrder Object specifying a linear order on Object for each agent, draft_rule s succ is the allocation Agent → Finset Object resulting from the sequential draft process draft_alloc succ (List.ofFn s) Finset.univ. In this process, starting with the set of all objects (Finset.univ) and the list of agents List.ofFn s, agents take turns in the order given by s: - At each turn, if the set of remaining objects is nonempty, the current agent picks their maximal element from the remaining objects according to their linear order succ a. This object is removed from the pool of remaining objects and added to agent a's allocated set. - If the remaining objects are exhausted, or when the sequence of turns ends, no further items are assigned. - Any agent receives the finite set of objects they selected across all their turns (or the empty set if they took no turns or no items were available).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The draft rule generated by a picking sequence on strict preference profiles. -/
def draft_rule {Agent Object : Type*} [DecidableEq Agent] [DecidableEq Object] [Fintype Object]
    {T : ℕ} (s : Fin T → Agent) (succ : Agent → LinearOrder Object) :
    Agent → Finset Object :=
  draft_alloc succ (List.ofFn s) Finset.univ
See it in the graphDiscuss this resultChallenge it