A 30-year-old fairness bound finally moved.
It tightens limits on random algorithms, sampling and load balancing.
Discrepancy theory measures how evenly items split into two groups under constraints, and the new proof narrows that limit.
Researchers have not said whether the new bound is achievable by an algorithm.
Sources: Quanta Magazine