two_agent_alternating_schedule
def
Given the number of goods m : ℕ, the alternating drafting schedule of length m is the function from Fin m to Fin 2 sending each turn t : Fin m to the agent with index t.val % 2 in Fin 2.
Statement
def two_agent_alternating_schedule (m : ℕ) : Fin m → Fin 2- Defined in
- Kalinowski et al., IJCAI 2013
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Used by 1
- two_agent_alternating_schedule_is_balancedFor every number of goods m : ℕ, the alternating drafting schedule two_agent_alternating_schedule m of length m is a balanced schedule for…
Read back from the Lean
Given a natural number $m$, two_agent_alternating_schedule m is defined as the function from $\mathrm{Fin}(m)$ to $\mathrm{Fin}(2)$ mapping each $t : \mathrm{Fin}(m)$ to $t \pmod 2$ (specifically, $\langle t.\mathrm{val} \pmod 2, h\rangle$ where $h : t.\mathrm{val} \pmod 2 < 2$).
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 standard alternating two-agent drafting schedule of length m, sending t : Fin m to ⟨t.val % 2, _⟩ : Fin 2. -/ def two_agent_alternating_schedule (m : ℕ) : Fin m → Fin 2 := fun t => ⟨t.val % 2, by omega⟩