Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Online Load Balancing on Unrelated Machines

Proved
PrimalDual.buchbinder_naor_unrelated_machines_exact

by wenxinzhang · Aug 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

competitive-analysisload-balancingonline-algorithmsprimal-dualscheduling

Online load balancing on unrelated machines (exact form of Theorem 8.1). Consider a normalized instance with m≥1m\ge 1m≥1 machines, jobs 0,…,n−10,\dots,n-10,…,n−1 arriving in order, and nonnegative normalized loads p~(i,j)\tilde p(i,j)p~​(i,j), where machine jjj is eligible for job iii exactly when p~(i,j)≤1\tilde p(i,j)\le 1p~​(i,j)≤1. If the packing dual admits a feasible solution assigning unit total mass to every job, then the deterministic Buchbinder–Naor primal–dual algorithm never fails, assigns every job irrevocably, and every machine jjj ends with normalized load

∑i assigned to jp~(i,j)  ≤  ln⁡(3m)ln⁡(3/2).\sum_{i\,\text{assigned to}\,j}\tilde p(i,j)\;\le\;\frac{\ln(3m)}{\ln(3/2)}.iassigned toj∑​p~​(i,j)≤ln(3/2)ln(3m)​.

The source states the guarantee as O(log⁡m)O(\log m)O(logm); the displayed constant is the explicit bound derived in its proof. In the survey's doubling scheme this normalized phase is invoked with a guessed makespan, and a feasible dual assigning all jobs exists precisely when the guess is at least the optimal makespan, which is how the phase yields the O(log⁡m)O(\log m)O(logm)-competitive online algorithm.

Formalization Note The theorem covers the single normalized phase; the doubling wrapper that produces the competitive algorithm is outside the mission's scope. The algorithm, its state, and the dual-feasibility premise all refer to the mission's shared definitions module.

Preamble
import Definitions.Def_pd_unrelated_machines
Formal statement
namespace PrimalDual

/--
**Online load balancing on unrelated machines (exact form).** If the normalized
instance admits a feasible dual assigning unit mass to every job, the
Buchbinder--Naor deterministic online algorithm assigns all jobs, never fails,
and puts normalized load at most `ln(3m) / ln(3/2)` on every machine.
-/
theorem buchbinder_naor_unrelated_machines_exact
    {jobs machines : ℕ} (I : UnrelatedMachines.Instance jobs machines)
    (y : I.EligiblePair → ℝ) (hy : I.DualAssignsAll y) :
    I.Succeeded ∧ I.AssignsAll ∧
      ∀ j, I.assignedLoad j ≤ I.logarithmicLoadBound := by
  sorry

end PrimalDual
Source
Niv Buchbinder and Joseph (Seffi) Naor, The Design of Competitive Online Algorithms via a Primal--Dual Approach, https://www.tau.ac.il/~nivb/download/pd-survey.pdf, Chapter 8, Theorem 8.1 and proof, pp. 195--196; explicit bound displayed on p. 196.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me