Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2(i), p. 10 (PDF 10) — with N ≤ M − 1 feedback periods an SPSE exists and every SPSE has all contractors exert q̲/N in every period, project level q̲

Proved
AssemblyCoord.Feedback.proposition_2_i

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

coordination-failureinformation-feedbackminimum-effort-gamep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1secure-equilibriumsubgame-perfect-equilibrium

Consider the MMM-contractor, NNN-period assembly coordination game with information feedback, started from zero effort, under the standing assumptions 1≤M1 \le M1≤M, 1≤N1 \le N1≤N, 0≤q‾<q∗<qˉ0 \le \underline q < q^* < \bar q0≤q​<q∗<qˉ​, p,γ,c>0p, \gamma, c > 0p,γ,c>0. If the number of feedback periods satisfies N≤M−1N \le M - 1N≤M−1, then:

  1. there is a subgame-perfect secure equilibrium (SPSE) in which every contractor exerts the minimum effort in every period,
qi,n=q‾N,i=1,…,M, n=1,…,N;q_{i,n} = \frac{\underline q}{N}, \qquad i = 1,\dots,M,\ n = 1,\dots,N;qi,n​=Nq​​,i=1,…,M, n=1,…,N;
  1. every SPSE has this property along its path, and its project effort level is
qmin⁡(q^N)=q‾.q_{\min}(\hat{\mathbf q}_N) = \underline q.qmin​(q^​N​)=q​.

This is the coordination-failure half of the paper's characterization: with too few feedback periods, the secure refinement of subgame perfection selects the worst outcome, even though higher project levels are supported by other equilibria.

Formalization Note. "There exists a unique SPSE in which all contractors exert the minimum effort" is stated as existence of such an SPSE together with "every SPSE exerts the minimum along its path". Uniqueness of the whole profile would be false, because Definition 2 does not constrain play off the equilibrium path. N≤M−1N \le M - 1N≤M−1 is written P.N + 1 ≤ P.M, and periods are 0-based (pathHist σ n). Part (ii) of Proposition 2, which concerns N>M−1N > M - 1N>M−1, is not formalized: it is false as printed (with M=2M = 2M=2, N=3N = 3N=3, q‾=3\underline q = 3q​=3, qˉ=9\bar q = 9qˉ​=9, q∗=7q^* = 7q∗=7, γ=p=1\gamma = p = 1γ=p=1, c=3/4c = 3/4c=3/4, a subgame-perfect equilibrium with path (1,1),(1,1),(3,3)(1,1), (1,1), (3,3)(1,1),(1,1),(3,3) has project level 555, and no SPSE reaches q∗=7q^* = 7q∗=7 although part (ii) predicts it at N=N∗=3N = N^* = 3N=N∗=3).

Preamble
import Mathlib
import Definitions.Def_AssemblyCoord_Feedback_Model
Formal statement
namespace AssemblyCoord.Feedback

theorem proposition_2_i (P : Params) (hP : P.Standing) (hN : P.N + 1 ≤ P.M) :
    (∃ σ : Profile P.M, P.IsSPSE 0 σ ∧
        ∀ n, n < P.N → ∀ i : Fin P.M, σ i (pathHist σ n) = P.qlo / P.N) ∧
    (∀ σ : Profile P.M, P.IsSPSE 0 σ →
        (∀ n, n < P.N → ∀ i : Fin P.M, σ i (pathHist σ n) = P.qlo / P.N) ∧
        projectLevel (P.final 0 σ []) = P.qlo) := by sorry

end AssemblyCoord.Feedback
Source
Zhang, Shokoohyar, Qi & Katok, Coordination for assembly, author manuscript (10 July 2025) of MSOM doi:10.1287/msom.2023.0342, p. 10 (PDF 10), Proposition 2(i)
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

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