Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1, (15) — without full cross-targeting ADX1 earns at most 2wφ(1 − α + η₁) < (13)

Proved
AdDataSharing.Base.revenue_bound_open

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

ad-exchange-revenueonline-advertisingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Assume the standing assumptions and suppose ADX1ADX_1ADX1​ allows cross-targeting. Then:

  1. for every profile in which not both advertisers share data with ADX1ADX_1ADX1​, its revenue is at most
2wφ(1−α+η1);(15)2w\varphi(1-\alpha+\eta_1); \tag{15}2wφ(1−α+η1​);(15)
  1. this bound is attained when one advertiser shares data with ADX1ADX_1ADX1​ and the other, on ADX2ADX_2ADX2​, cross-targets it on ADX1ADX_1ADX1​;
  2. the bound is strictly less than the closed revenue 2wφ(1−α+η2)2w\varphi(1-\alpha+\eta_2)2wφ(1−α+η2​) of (13).

This gives the "only if" direction of Proposition 1: without full cross-targeting, opening is strictly worse for ADX1ADX_1ADX1​.

Formalization Note. The bound holds for every such profile, not only equilibria, so no equilibrium hypothesis is needed.

Preamble
import Mathlib
import Definitions.Def_AdDataSharing_Base_Model
Formal statement
namespace AdDataSharing.Base

/-- Proof of Proposition 1, p. 28, display (15): if ADX1 is open and not both advertisers
contract with it, its revenue is at most `2wφ(1 − α + η₁)`; this bound is attained when one
advertiser contracts with ADX1 and the other cross-targets on ADX1; and it is strictly less than
(13). -/
theorem revenue_bound_open (P : Params) (hP : P.Standing) :
    (∀ σ : Plan × Plan, ¬ (σ.1.ex = .adx1 ∧ σ.2.ex = .adx1) →
        revenue P true σ ≤ 2 * P.w * P.φ * (1 - P.α + P.η₁)) ∧
      (∀ s : Bool, revenue P true (⟨.adx1, s⟩, ⟨.adx2, true⟩) = 2 * P.w * P.φ * (1 - P.α + P.η₁)) ∧
      2 * P.w * P.φ * (1 - P.α + P.η₁) < 2 * P.w * P.φ * (1 - P.α + P.η₂) := by sorry

end AdDataSharing.Base
Source
Johnson, Jungbauer, Preuss, Online Advertising, Data Sharing, and Consumer Control, SSRN 3898798 (Nov. 2, 2022), p. 28, proof of Proposition 1, display (15)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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