Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Table 3 (2nd column), p. 16 (PDF 16) — the no-promotion equilibrium

Proved
BOGOPromo.NoStockpile.np_equilibrium

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

double-marginalizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stackelberg-gamesupply-chain

Let the unit production cost satisfy 0≤c<10\le c<10≤c<1 and consider the game in which the retailer can only set a single price. An equilibrium (manufacturer leading, retailer best-responding at every wholesale price in (0,1](0,1](0,1]) exists, and in every equilibrium

w=1+c2,p=3+c4,D=1−c2,πr=(1−c)28,πm=(1−c)24.w=\frac{1+c}{2},\quad p=\frac{3+c}{4},\quad D=\frac{1-c}{2},\quad \pi_r=\frac{(1-c)^2}{8},\quad \pi_m=\frac{(1-c)^2}{4}.w=21+c​,p=43+c​,D=21−c​,πr​=8(1−c)2​,πm​=4(1−c)2​.

This is the benchmark against which Corollary 4 compares the BOGO and PR outcomes.

Formalization Note The page allows 0≤c≤10\le c\le 10≤c≤1; the case c=1c=1c=1 is excluded. There the manufacturer's profit (w−1)(1−w)(w-1)(1-w)(w−1)(1−w) forces w=1w=1w=1, but at w=1w=1w=1 every retail price p≥1p\ge 1p≥1 is a best response (profit 000), so the retail price (3+c)/4=1(3+c)/4=1(3+c)/4=1 of the table is one equilibrium outcome, not the only one.

Preamble
import Mathlib
import Definitions.Def_BOGOPromo_NoStockpile_Model
Formal statement
namespace BOGOPromo.NoStockpile

theorem np_equilibrium (c : ℝ) (hc0 : 0 ≤ c) (hc1 : c < 1) :
    (∃ (w : ℝ) (r : ℝ → ℝ), IsEqN c w r) ∧
    ∀ (w : ℝ) (r : ℝ → ℝ), IsEqN c w r →
      w = (1 + c) / 2 ∧ r w = (3 + c) / 4 ∧ npDemand (r w) = (1 - c) / 2 ∧
      npProfit w (r w) = (1 - c) ^ 2 / 8 ∧ (w - c) * npDemand (r w) = (1 - c) ^ 2 / 4 := by sorry

end BOGOPromo.NoStockpile
Source
Li, Khouja, Pan & Zhou, Buy-One-Get-One Promotions in a Two-Echelon Supply Chain, SSRN working paper 3561162, p. 16 (PDF 16), Table 3 (2nd column, No Promotion)
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

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