Theorem 3 (first sentence) — no online algorithm beats expected approximation factor 26/27 on the 6-cycle
ProvedOnlineStochMatching.Hardness.theorem_3_single_cycleConsider the 6-cycle instance: advertisers , impression types , edges , the uniform distribution on the three types, and arrivals. For every randomized online algorithm, the expected approximation factor satisfies
where the expectation is over the algorithm's randomness and the three i.i.d. uniform arrivals.
This is the first sentence of Theorem 3: there is an instance of the online stochastic matching problem on which no algorithm can achieve an expected approximation factor better than . It shows that, unlike the offline problem, the online i.i.d. problem has no algorithm with expected factor arbitrarily close to on every instance.
Formalization Note A randomized online algorithm is a probability distribution P on deterministic online algorithms (see the model definition); the bound holds for every such P. On this instance every arrival has an adjacent advertiser, so on every arrival sequence and the ratio is never .
import Mathlib import Definitions.Def_OnlineStochMatching_Hardness_Model import Definitions.Def_OnlineStochMatching_Hardness_SixCycle
namespace OnlineStochMatching.Hardness
/-- Theorem 3, first sentence (p. 4): on the 6-cycle instance (three advertisers, three
impression types, uniform arrivals, `n = 3`), every randomized online algorithm has expected
approximation factor `E[ALG/OPT]` at most `26/27`. -/
theorem theorem_3_single_cycle (P : PMF (OnlineAlg Adv Imp 3)) :
randExpectedRatio cycleEdge P ≤ 26 / 27 := by sorry
end OnlineStochMatching.Hardness
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.