deterministic_to_randomized
Lifts a deterministic prediction-free online chore rule rule : DeterministicOnlineChoreRule n to a randomized online chore algorithm deterministic_to_randomized rule : RandomizedOnlineChoreAlgorithm n with sample space Unit, probability mass function PMF.pure (), and constant rule function fun _ => rule.
Statement
noncomputable def deterministic_to_randomized {n : ℕ} (rule : DeterministicOnlineChoreRule n) : RandomizedOnlineChoreAlgorithm n
- Defined in
- arXiv:2611.00432 Sec 4
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 2
- RandomizedOnlineChoreAlgorithmA structure parameterized by the number of agents n : ℕ, consisting of three bundled fields: a sample space type Ω : Type, a probability…
- DeterministicOnlineChoreRuleA deterministic prediction-free online chore allocation algorithm for n agents with upgrade recourse: for each sequence of arrival costs…
Read back from the Lean
For any natural number n and any deterministic online chore rule rule on n agents, deterministic_to_randomized rule defines a randomized online chore algorithm on n agents whose sample space Ω is Unit, whose probability distribution is the Dirac point mass at () (PMF.pure ()), and whose associated deterministic rule for () is rule.
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
/-- Lift a deterministic online chore rule to a randomized online chore algorithm. -/ noncomputable def deterministic_to_randomized {n : ℕ} (rule : DeterministicOnlineChoreRule n) : RandomizedOnlineChoreAlgorithm n := ⟨Unit, PMF.pure (), fun _ => rule⟩