AFTD Auto-Formalizing Theoretical Domains

picking_sequence_outcome

def

The allocation returned by the picking-sequence mechanism PS_π: agents act in the order seq, and at each turn the active agent takes its highest-ranked remaining good, where rank i k is the good agent i reports in position k (position 0 is its top good).

Statement

def picking_sequence_outcome {N G : Type*} [DecidableEq N] [DecidableEq G]
    {m : ℕ} (seq : List N) (rank : N → Fin m ≃ G) : N → Finset G
Defined in
arXiv:2610.23040 (On the Convergence of Iterated Round Robin), Sec. 2; also arXiv:2610.23686 Sec. 2
Verified
19 Oct 2026
Axioms
none listed
Built on 1
  • picking_turnOne turn of a picking-sequence mechanism: the active agent i receives the first good of its reported ranking l (best first) that is not…
Used by 32

Lean source view module on GitHub

/-- The allocation of the picking-sequence mechanism `PS_π`: agents act in the order `seq`, and at each turn the active agent takes its highest-ranked available good; `rank i k` is the good agent `i` reports in position `k` (position `0` best). -/
def picking_sequence_outcome {N G : Type*} [DecidableEq N] [DecidableEq G]
    {m : ℕ} (seq : List N) (rank : N → Fin m ≃ G) : N → Finset G :=
  (seq.foldl (fun st i => picking_turn (List.ofFn (rank i)) i st) (fun _ => ∅, ∅)).1
See it in the graphDiscuss this resultChallenge it