Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 4 — on the 6-cycle every online algorithm loses an impression on some scenario (u, v, v) where OPT = 3

Proved
OnlineStochMatching.Hardness.xyy_scenario

by mikedeng1 · Oct 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

bipartite-matchinglower-boundonline-algorithmsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider the 6-cycle instance: advertisers {a,b,c}\{a, b, c\}{a,b,c}, impression types {x,y,z}\{x, y, z\}{x,y,z}, edges {(x,a),(y,a),(y,b),(z,b),(z,c),(x,c)}\{(x,a),(y,a),(y,b),(z,b),(z,c),(x,c)\}{(x,a),(y,a),(y,b),(z,b),(z,c),(x,c)}, and n=3n = 3n=3 arrivals. Let A\mathcal AA be any deterministic online algorithm and let u∈{x,y,z}u \in \{x, y, z\}u∈{x,y,z} be the type of the first arrival. Then there is a type vvv such that, on the arrival sequence (u,v,v)(u, v, v)(u,v,v),

ALG(u,v,v)≤2andOPT(u,v,v)=3.\mathrm{ALG}(u, v, v) \le 2 \qquad\text{and}\qquad \mathrm{OPT}(u, v, v) = 3.ALG(u,v,v)≤2andOPT(u,v,v)=3.

In the paper's case the first arrival is xxx and the algorithm assigns it to aaa; then v=yv = yv=y: both yyy impressions are adjacent only to aaa and bbb, so at most one of them can be assigned, while with hindsight x→cx \to cx→c, y→ay \to ay→a, y→by \to by→b assigns all three. The statement covers every first type and every first decision (assigning to either neighbour, or not assigning at all).

Since the algorithm's first decision depends only on uuu, and each scenario (u,v,v)(u, v, v)(u,v,v) has probability 1/271/271/27, this places a ratio ALG/OPT≤2/3\mathrm{ALG}/\mathrm{OPT} \le 2/3ALG/OPT≤2/3 on a set of scenarios of total probability 1/91/91/9, which is what drives the bound 26/2726/2726/27 of Theorem 3.

Formalization Note The paper's "without loss of generality (from the symmetry of the 6-cycle)" is replaced by quantifying over every first type uuu; the algorithm's first decision is whatever it does on uuu. The arrival sequence is written ![u, v, v].

Preamble
import Mathlib
import Definitions.Def_OnlineStochMatching_Hardness_Model
import Definitions.Def_OnlineStochMatching_Hardness_SixCycle
Formal statement
namespace OnlineStochMatching.Hardness

/-- §3, p. 4 (the "(x, y, y)" argument behind Theorem 3). On the 6-cycle with `n = 3` arrivals,
for every deterministic online algorithm and every type `u` of the first arrival there is a type
`v` such that on the scenario `(u, v, v)` the algorithm assigns at most two arrivals while the
optimum assigns all three. (The paper's case: `u = x` assigned to `a`, `v = y`.) -/
theorem xyy_scenario (alg : OnlineAlg Adv Imp 3) (u : Imp) :
    ∃ v : Imp, ALG cycleEdge alg ![u, v, v] ≤ 2 ∧ OPT cycleEdge ![u, v, v] = 3 := by sorry

end OnlineStochMatching.Hardness
Source
Feldman, Mehta, Mirrokni, Muthukrishnan, Online Stochastic Matching: Beating 1-1/e, arXiv:0905.4100v1, p. 4, Section 3, the (x, y, y) argument preceding Theorem 3
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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