Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (12), p. 3188 — the licensee's effort is ρ/(2 − ρ)·[(1 − α)e_C − s] if s < (1 − α)e_C, else 0

Proved
BrandLicensing.Intensive.eq_12_licensee_effort

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

best-responsebrand-licensingmoral-hazardp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Under the standing assumptions, fix a core effort eC≥0e_C\ge0eC​≥0 and a royalty s≥0s\ge0s≥0. An effort eE≥0e_E\ge0eE​≥0 maximizes the licensee's profit πL=ρmax⁡{(1−α)eC+eE−s,0}2/4−12eE2\pi_L=\rho\max\{(1-\alpha)e_C+e_E-s,0\}^2/4-\tfrac12e_E^2πL​=ρmax{(1−α)eC​+eE​−s,0}2/4−21​eE2​ (10) over eE≥0e_E\ge0eE​≥0 if and only if

eE=ρ2−ρmax⁡{(1−α)eC−s,  0}.e_E=\frac{\rho}{2-\rho}\max\{(1-\alpha)e_C-s,\;0\}.eE​=2−ρρ​max{(1−α)eC​−s,0}.

So the licensee's best response is unique: it is the solution ρ2−ρ[(1−α)eC−s]\frac{\rho}{2-\rho}[(1-\alpha)e_C-s]2−ρρ​[(1−α)eC​−s] of the first-order condition (11) when s<(1−α)eCs<(1-\alpha)e_Cs<(1−α)eC​, and 000 otherwise. It does not depend on θ\thetaθ or λ\lambdaλ, and it decreases in sss (double marginalization).

Formalization Note The case s≥(1−α)eCs\ge(1-\alpha)e_Cs≥(1−α)eC​ ("otherwise, eEe_EeE​ vanishes") relies on the positive part in the definition of πM\pi^MπM.

Preamble
import Mathlib
import Definitions.Def_BrandLicensing_Intensive_Model
Formal statement
namespace BrandLicensing.Intensive

/-- (12), p. 3188: for every core effort `c ≥ 0` and royalty `s ≥ 0`, the licensee's optimal effort
is unique and equals `ρ/(2 − ρ)·[(1 − α)c − s]` if `s < (1 − α)c`, and `0` otherwise. -/
theorem eq_12_licensee_effort (P : Params) (hP : P.Standing) (c s : ℝ) (hc : 0 ≤ c) (hs : 0 ≤ s)
    (e : ℝ) (he : 0 ≤ e) :
    (∀ e', 0 ≤ e' → piLicensee P c s e' ≤ piLicensee P c s e) ↔ e = eE12 P c s := by sorry
end BrandLicensing.Intensive
Source
Bacchiega, Colucci, Denicolò & Magnani, Only the Ugly Face? A Theoretical Model of Brand Dilution, Management Science 70(5) (2024), p. 3188 (PDF 8), §4.2.2.1, eqs. (11), (12)
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

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