Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4, p. 20 — the seller does not remove genuine negative reviews iff b ≥ b̲ = (1 − γ)[π(a) − π(a^s_N)]

Proved
ReviewBlackmail.SemiDec.proposition_4

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

dispute-resolutionequilibriump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1penaltyreview-blackmail

Under the semi-decentralized mechanism let

b‾:=(1−γ)[π(a)−π(aNs)].\underline b:=(1-\gamma)\big[\pi(a)-\pi(a^s_N)\big].b​:=(1−γ)[π(a)−π(aNs​)].

Under the standing assumptions:

  1. When the market believes that the seller settles with malicious consumers and keeps genuine negative reviews, removing a genuine negative review through the mechanism is not profitable for the seller, i.e. (1−γ)π(a0s)+γπ(aNs)−b≤π(aNs)(1-\gamma)\pi(a^s_0)+\gamma\pi(a^s_N)-b\le\pi(a^s_N)(1−γ)π(a0s​)+γπ(aNs​)−b≤π(aNs​), if and only if b≥b‾b\ge\underline bb≥b​.
  2. If moreover 0<γ<10<\gamma<10<γ<1 and b≥b‾b\ge\underline bb≥b​, then removing genuine negative reviews is not an equilibrium: when the market believes that the seller settles with malicious consumers and removes genuine negative reviews (posteriors aRsda^{sd}_RaRsd​ of (38)), keeping a genuine negative review is strictly more profitable, i.e.
π(aNsd)>(1−γ)π(a0sd)+γπ(aNsd)−b.\pi(a^{sd}_N)>(1-\gamma)\pi(a^{sd}_0)+\gamma\pi(a^{sd}_N)-b.π(aNsd​)>(1−γ)π(a0sd​)+γπ(aNsd​)−b.

Together these say that the seller does not use the mechanism against genuine reviews exactly when the penalty is at least b‾\underline bb​; this is why Proposition 5 restricts attention to b≥b‾b\ge\underline bb≥b​ and to sellers who keep genuine reviews.

Formalization Note The statement follows the two claims into which the proof (pp. 40–41) splits Proposition 4, restricted, as the proof is, to the beliefs in which the malicious consumer settles or does not buy (the latter has the same posteriors). It is not a claim about every equilibrium of a larger game. The hypothesis 0<γ<10<\gamma<10<γ<1 in part 2 is added: γ>0\gamma>0γ>0 makes aNsd=aNsa^{sd}_N=a^s_NaNsd​=aNs​ (at γ=0\gamma=0γ=0 no genuine negative review is ever visible), and at γ=1\gamma=1γ=1 one has b=b‾=0b=\underline b=0b=b​=0 with removal a weak best response.

Preamble
import Mathlib
import Definitions.Def_ReviewBlackmail_SemiDec_Setting
Formal statement
namespace ReviewBlackmail.SemiDec
theorem proposition_4 (M : Model) (hM : M.Standing) :
    (M.KeepGenuineBR ↔ M.bLow ≤ M.b) ∧
    (0 < M.γ → M.γ < 1 → M.bLow ≤ M.b → ¬ M.RemoveGenuineBR) := by sorry
end ReviewBlackmail.SemiDec
Source
Papanastasiou, Yang, Zhang, Improving Dispute Resolution in Two-Sided Platforms: The Case of Review Blackmail, accepted manuscript (LBS Research Online eprint 1988; Management Science 69(10), 2023, doi:10.1287/mnsc.2022.4655), p. 20, Proposition 4; pp. 40–41, Proof of Proposition 4, (21); pp. 51–52, Proof of Proposition 13, (38)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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