Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§3.2, p. 12, (6)–(7) — informative equilibrium iff both incentive conditions hold

Proved
CustomerVoice.ALearn.equilibrium_iff_ic

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

cheap-talkincentive-compatibilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1separating-equilibrium

In the two-type A-Learning game under its standing assumptions, an informative separating equilibrium exists if and only if both buyer types prefer truthful communication to imitating the other type:

u(θH,θH)≥u(θH,θL)andu(θL,θL)≥u(θL,θH).u(\theta_H,\theta_H)\geq u(\theta_H,\theta_L)\quad\text{and}\quad u(\theta_L,\theta_L)\geq u(\theta_L,\theta_H).u(θH​,θH​)≥u(θH​,θL​)andu(θL​,θL​)≥u(θL​,θH​).

Here u(θ,θ^)u(\theta,\hat\theta)u(θ,θ^) is the buyer's expected payoff when its actual type is θ\thetaθ, the seller believes θ^\hat\thetaθ^, and the seller designs at its optimum for that belief.

The equivalence connects the full cheap-talk equilibrium conditions to the two explicit incentive constraints (6) and (7).

Formalization Note An equilibrium includes a separating message rule, on-path belief consistency, attained seller optimality over nonnegative quality, and buyer optimality against every message. The pricing stage is represented by equation (5).

Preamble
import Mathlib
import Definitions.Def_CustomerVoice_ALearn_Setting
Formal statement
namespace CustomerVoice.ALearn

/-- §3.2, p. 12, equations (6)–(7): truthful informative communication is
an equilibrium exactly when both incentive conditions hold. -/
theorem equilibrium_iff_ic (M : Model) (hM : M.Standing) :
    M.InformativeEq ↔ M.ICH ∧ M.ICL := by sorry

end CustomerVoice.ALearn
Source
Guo, The Voice of Customers in Customization, SSRN working paper 3994319 (version of 2023-11-29, https://ssrn.com/abstract=3994319), p. 12, §3.2, (5)–(7)
Human review
  • Endorsed by Shuze Chen · Oct 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 16, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me