Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(A.3), App. p. 1 — trial-effort first-order condition and m∗(N) = A(N−1)/(N²c₃)

Proved
ProblemSpec.Equilibrium.eq_A_3

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

crowdsourcingfirst-order-conditionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1trial-effort

Fix N>1N>1N>1 participants, Sg≥0S_g\ge0Sg​≥0, and a symmetric profile in which every designer plays (r,m)(r,m)(r,m) with m>0m>0m>0. A participant's expected utility Pr⁡(i wins)⋅A−Ci(r,mi)\Pr(i\text{ wins})\cdot A-C_i(r,m_i)Pr(i wins)⋅A−Ci​(r,mi​), as a function of her own number of trials mim_imi​, is differentiable at mi=mm_i=mmi​=m with derivative

A (N−1) m(mN)2−c3,c3=h(Sg),A\,\frac{(N-1)\,m}{(mN)^2}-c_3,\qquad c_3=h(S_g),A(mN)2(N−1)m​−c3​,c3​=h(Sg​),

and this derivative vanishes if and only if

m=m∗(N)=A(N−1)N2c3.m=m^*(N)=\frac{A(N-1)}{N^2c_3}.m=m∗(N)=N2c3​A(N−1)​.

This is the first-order condition that pins down the equilibrium trial effort.

Preamble
import Mathlib
import Definitions.Def_ProblemSpec_Equilibrium_Model
Formal statement
namespace ProblemSpec.Equilibrium

/-- (A.3), App. p. 1 (PDF 29). At a symmetric profile (`ri = r`, `mi = m > 0`, `N > 1`), a
participant's expected utility is differentiable in her number of trials `mi` at `mi = m`, with
derivative `A (N−1) m / (m N)² − c3`, `c3 = h(Sg)`; this derivative vanishes exactly when
`m = m∗(N) = A(N−1)/(N² c3)`. -/
theorem eq_A_3 (P : Params) (hP : P.Standing) (Sr Sg N r m : ℝ) (hSg : 0 ≤ Sg) (hN : 1 < N)
    (hm : 0 < m) :
    HasDerivAt (fun x => payoff P Sr Sg N r x r m)
        (P.A * ((N - 1) * m / (m * N) ^ 2) - P.h Sg) m ∧
      (P.A * ((N - 1) * m / (m * N) ^ 2) - P.h Sg = 0 ↔ m = mstar P Sg N) := by sorry

end ProblemSpec.Equilibrium
Source
Jiang, Huang & Beil, The Role of Problem Specification in Crowdsourcing Contests for Design Problems, SSRN 3260862 (version of 30 Oct 2019), App. p. 1 (PDF 29), (A.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