Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equations (2)–(3), p. 9 — single-agent optimal effort and success rate

Proved
InnovAlloc.Optimal.equations_2_3

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

best-responseinnovationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1success-probability

Fix an innovator's share γ∈(0,1)\gamma\in(0,1)γ∈(0,1) and a positive resource allocation bbb. If the other agent receives no resources, the innovator maximizes γ(1−e−bx)−x\gamma(1-e^{-bx})-xγ(1−e−bx)−x over efforts x≥0x\ge0x≥0. The unique maximizing effort is x∗(b)=0x^*(b)=0x∗(b)=0 for γb<1\gamma b<1γb<1 and x∗(b)=log⁡(γb)/bx^*(b)=\log(\gamma b)/bx∗(b)=log(γb)/b for γb≥1\gamma b\ge1γb≥1. Its success probability is

p(b,x∗(b))={0,γb≤1,1−1/(γb),γb>1.p(b,x^*(b))=\begin{cases}0,&\gamma b\le1,\\1-1/(\gamma b),&\gamma b>1.\end{cases}p(b,x∗(b))={0,1−1/(γb),​γb≤1,γb>1.​

The success probability is nondecreasing as the positive resource allocation grows. This gives the single-agent behavior used in the principal's one-agent investment calculation.

Formalization Note The paper's “increasing” is weak monotonicity here: the success rate stays zero until γb>1\gamma b>1γb>1.

Preamble
import Mathlib
import Definitions.Def_InnovAlloc_Optimal_Model
Formal statement
namespace InnovAlloc.Optimal

/-- Equations (2)–(3), p. 9: the single-agent best response and its success rate. -/
theorem equations_2_3 (γ b : ℝ) (hγ : 0 < γ) (hγ1 : γ < 1) (hb : 0 < b) :
    (∀ x : ℝ, 0 ≤ x →
      ((∀ z : ℝ, 0 ≤ z → γ * succ b z - z ≤ γ * succ b x - x) ↔
        x = effortStar γ b)) ∧
    succ b (effortStar γ b) =
      (if γ * b ≤ 1 then 0 else 1 - 1 / (γ * b)) ∧
    MonotoneOn (fun t : ℝ => succ t (effortStar γ t)) (Set.Ioi 0) := by sorry

end InnovAlloc.Optimal
Source
Gao, Fan, Huang & Chen, “Resource Allocation Among Competing Innovators”, SSRN preprint 3658157 (February 2021), p. 9, eqs. (2)–(3)
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