Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix, p. 29 — case 2 equilibrium requests satisfy seller acceptance bounds

Proved
CustomerVoice.ONoOther.equilibrium_requests_accepted

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1seller-acceptancesignaling

Let the O-Learning model satisfy its standing assumptions and θH/θL<ΛL\theta_H/\theta_L<\Lambda_LθH​/θL​<ΛL​. For any separating pure-strategy equilibrium with requests qH,qLq_H,q_LqH​,qL​ and any on-path-consistent belief function, both requests lie within the corresponding seller acceptance ranges:

qH≤γθHs+γk,qL≤γθLs+γk.q_H\le\frac{\gamma\theta_H}{s+\gamma k},\qquad q_L\le\frac{\gamma\theta_L}{s+\gamma k}.qH​≤s+γkγθH​​,qL​≤s+γkγθL​​.

These are the feasibility bounds the Appendix uses before comparing the two types' incentives to imitate.

Formalization Note Acceptance uses the paper's payoff inequality, including acceptance at equality. A rejected request pays zero, so equilibrium optimality has content at this step.

Preamble
import Mathlib
import Definitions.Def_CustomerVoice_ONoOther_Setting
Formal statement
namespace CustomerVoice.ONoOther

theorem equilibrium_requests_accepted (M : Model) (hM : M.Standing)
    (hr : M.θH / M.θL < M.LambdaL)
    (req : CustomerVoice.ALearn.BType → ℝ) (bel : ℝ → CustomerVoice.ALearn.BType) (heq : M.OSepEq req bel) :
    req .H ≤ M.γ * M.θH / (M.s + M.γ * M.k) ∧
      req .L ≤ M.γ * M.θL / (M.s + M.γ * M.k) := by sorry

end CustomerVoice.ONoOther
Source
Guo, The Voice of Customers in Customization, SSRN working paper 3994319 (version of 2023-11-29, https://ssrn.com/abstract=3994319), p. 29, Appendix, No Other Separating Equilibrium under the O-Learning Customization
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me