Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 1, case 2 — (Fee, Fee): p₁ = p₂ = 1 is the unique stage-2 equilibrium, profit (λ+µ)/2 each

Proved
AdBlockers.Allow.case_2_fee_fee

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

hotellingnash-equilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let λ,μ>0\lambda, \mu > 0λ,μ>0 and suppose both platforms charge a subscription fee (the Fee plan, the same in the main model and in the benchmark). Then p1=p2=1p_1 = p_2 = 1p1​=p2​=1 is a stage-2 equilibrium, each platform earns

r1=r2=λ+μ2,r_1 = r_2 = \frac{\lambda + \mu}{2},r1​=r2​=2λ+μ​,

and every stage-2 equilibrium (p1,p2)(p_1, p_2)(p1​,p2​) of this subgame has p1=p2=1p_1 = p_2 = 1p1​=p2​=1.

This is the (Fee, Fee) entry of the benchmark payoff table (Table 1).

Preamble
import Mathlib
import Definitions.Def_AdBlockers_Allow_Model
Formal statement
namespace AdBlockers.Allow

/-- Proof of Proposition 1 (Appendix A.1), case 2, pp. 40–41 (benchmark, both platforms charge a
Fee): `p₁ = p₂ = 1` is a stage-2 equilibrium of the (Fee, Fee) subgame, each platform earns
`(λ + µ)/2`, and it is the only stage-2 equilibrium of that subgame. -/
theorem case_2_fee_fee (lam μ β γ : ℝ) (hlam : 0 < lam) (hμ : 0 < μ) :
    IsStage2NE lam μ β γ BenchPlan.fee.toPlan BenchPlan.fee.toPlan 1 1 ∧
      rev₁ lam μ β γ BenchPlan.fee.toPlan BenchPlan.fee.toPlan 1 1 = (lam + μ) / 2 ∧
      rev₂ lam μ β γ BenchPlan.fee.toPlan BenchPlan.fee.toPlan 1 1 = (lam + μ) / 2 ∧
      ∀ p₁ p₂ : ℝ, IsStage2NE lam μ β γ BenchPlan.fee.toPlan BenchPlan.fee.toPlan p₁ p₂ →
        p₁ = 1 ∧ p₂ = 1 := by sorry

end AdBlockers.Allow
Source
Despotakis, Ravi & Srinivasan, The Beneficial Effects of Ad Blockers, SSRN 3083119 (version of Nov. 28, 2017), pp. 40–41, proof of Proposition 1 (Appendix A.1), case 2; Table 1, p. 17
Human review
  • Endorsed by Shuze Chen · Oct 19, 2026

    Confirmed by the moderator at approval.

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