Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(15), p. 13 — the retailer's expected profit without sales information

Proved
SalesTrust.Sharing.eq_15

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1repeated-gamesupply-chain

Under the standing assumptions, the retailer's expected per-period profit at the no-sharing menu of Proposition 1 is

ΠRD,ne=p(VH−VL)(VL−pVH)2(1−p)+δ(1−δ) p2(VH−VL)22(1−p),\Pi^{D,ne}_R = \frac{p(V_H - V_L)(V_L - pV_H)}{2(1-p)} + \delta(1-\delta)\,\frac{p^2(V_H - V_L)^2}{2(1-p)},ΠRD,ne​=2(1−p)p(VH​−VL​)(VL​−pVH​)​+δ(1−δ)2(1−p)p2(VH​−VL​)2​,

and the first term is the static profit, ΠRS=pΔ(qLS)=p(VH−VL)(VL−pVH)2(1−p)\Pi^S_R = p\Delta(q^S_L) = \dfrac{p(V_H - V_L)(V_L - pV_H)}{2(1-p)}ΠRS​=pΔ(qLS​)=2(1−p)p(VH​−VL​)(VL​−pVH​)​.

This is the no-sharing side of the comparison in Proposition 3.

Preamble
import Mathlib
import Definitions.Def_SalesTrust_Sharing_Model
Formal statement
namespace SalesTrust.Sharing

/-- (15), p. 13: the retailer's expected profit at the no-sharing menu. -/
theorem eq_15 (P : Params) (hS : P.Standing) :
    retailerProfit P (menuNE P) =
        P.p * (P.VH - P.VL) * (P.VL - P.p * P.VH) / (2 * (1 - P.p)) +
          P.δ * (1 - P.δ) * (P.p ^ 2 * (P.VH - P.VL) ^ 2 / (2 * (1 - P.p))) ∧
      staticRent P = P.p * (P.VH - P.VL) * (P.VL - P.p * P.VH) / (2 * (1 - P.p)) := by sorry

end SalesTrust.Sharing
Source
Shamir & Yehezkel, Sales information transparency and trust in repeated vertical relationships, authors' manuscript (January 2023; MSOM, DOI 10.1287/msom.2023.1208), p. 13 (PDF 14), (15)
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