AFTD Auto-Formalizing Theoretical Domains

round_robin_phi_vector

def

The potential of arXiv:2610.23040 (Thm 3.13) for Round Robin with n agents and m goods: the vector Phi(r) = (phi_0(r), ..., phi_{m-1}(r)) of the 0-based ranks of the items selected at each of the m turns.

Statement

def round_robin_phi_vector {n : ℕ} [NeZero n] (m : ℕ) (rank : Fin n → Fin m ≃ Fin m) : List ℕ
Source
step towards round_robin_item_preserving_swaps_polynomial_convergence
Verified
20 Oct 2026
Axioms
none listed
Built on 2
  • picking_phi_entryThe coordinate phi_s of the potential of arXiv:2610.23040 (proof of Thm 3.13): at turn s the acting agent takes the highest-ranked item…
  • round_robin_sequenceThe Round-Robin picking sequence (1, 2, ..., n, 1, 2, ...) of length m, with agents numbered 0, ..., n-1.

Lean source view module on GitHub

/-- The lexicographic potential Phi for the Round-Robin sequence. -/
def round_robin_phi_vector {n : ℕ} [NeZero n] (m : ℕ) (rank : Fin n → Fin m ≃ Fin m) : List ℕ := List.ofFn (fun s : Fin m => picking_phi_entry (round_robin_sequence n m) rank s.val)
See it in the graphDiscuss this resultChallenge it