Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 9, p. 15 — the optimal allocation of every permuted instance is N (N·B after scaling), attained by Q_i ↦ π(i)

Proved
AdWordsMSVV.LowerBound.opt_round_instance

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

adwordsb-matchingoffline-optimump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let N,BN, BN,B be natural numbers and π\piπ a permutation of the NNN bidders. On the permuted round instance IπI_\piIπ​ (budget BBB, NNN rounds of BBB queries, round QiQ_iQi​ bid on by π(i),…,π(N)\pi(i),\dots,\pi(N)π(i),…,π(N)), the allocation τπ\tau_\piτπ​ that sends every query of QiQ_iQi​ to bidder π(i)\pi(i)π(i) has offline revenue NBNBNB, and no allocation earns more:

revB(Iπ,τπ)=NB,revB(Iπ,τ)≤NB  for every allocation τ.\mathrm{rev}_B(I_\pi,\tau_\pi) = NB, \qquad \mathrm{rev}_B(I_\pi,\tau) \le NB \ \text{ for every allocation } \tau.revB​(Iπ​,τπ​)=NB,revB​(Iπ​,τ)≤NB  for every allocation τ.

In the paper's units (budget 111, bids ϵ=1/B\epsilon = 1/Bϵ=1/B) the optimum is NNN. This fixes the denominator of the competitive ratio in Theorem 9.

Preamble
import Mathlib
import Definitions.Def_AdWordsMSVV_LowerBound_Setting
Formal statement
namespace AdWordsMSVV.LowerBound

theorem opt_round_instance (N B : ℕ) (π : Equiv.Perm (Fin N)) :
    offlineRevenue B (roundInstance N B π) (roundAllocation N B π) = N * B ∧
    ∀ τ : Fin (N * B) → Option (Fin N), offlineRevenue B (roundInstance N B π) τ ≤ N * B := by sorry

end AdWordsMSVV.LowerBound
Source
Mehta, Saberi, Vazirani, Vazirani, AdWords and generalized on-line matching, J. ACM (2007), DOI 10.1145/1284320.1284321, p. 15, proof of Theorem 9, second paragraph
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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