Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5), p. 21 — the posterior a^d_N after a negative review under the semi-decentralized mechanism, and a^i_0 = a

Proved
ReviewBlackmail.SemiDec.eq5_posteriors

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

bayesian-updatingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1posterior-beliefreview-blackmail

Under the standing assumptions of the semi-decentralized model, the posterior beliefs produced by Bayes' rule have the following closed forms. Write ρ=1−p/(aθ)\rho=1-p/(a\theta)ρ=1−p/(aθ) and let aR(m,1)a_R(m,1)aR​(m,1) be the market's posterior after review RRR when a malicious negative review stays visible with probability mmm and genuine reviews are kept.

  1. No review leaves the belief at the prior: a0(m,1)=aa_0(m,1)=aa0​(m,1)=a for every m∈[0,1]m\in[0,1]m∈[0,1]; in particular a0s=a0n=a0d=aa^s_0=a^n_0=a^d_0=aa0s​=a0n​=a0d​=a.
  2. Under the mechanism (m=γ(1−δ)m=\gamma(1-\delta)m=γ(1−δ)), the posterior after a negative review is (5):
aNd=aa+(1−a)βγ(1−δ)+(1−β)(1−paθ)βγ(1−δ)+(1−β)(1−paθ)(1−θ).a^d_N=\frac{a}{a+(1-a)\dfrac{\beta\gamma(1-\delta)+(1-\beta)\left(1-\frac{p}{a\theta}\right)}{\beta\gamma(1-\delta)+(1-\beta)\left(1-\frac{p}{a\theta}\right)(1-\theta)}}.aNd​=a+(1−a)βγ(1−δ)+(1−β)(1−aθp​)(1−θ)βγ(1−δ)+(1−β)(1−aθp​)​a​.
  1. Doing nothing (m=1m=1m=1) and settling (m=0m=0m=0) give Lemma 2's
aNn=aa+(1−a)β+(1−β)(1−paθ)β+(1−β)(1−paθ)(1−θ),aNs=aa+(1−a)11−θ.a^n_N=\frac{a}{a+(1-a)\dfrac{\beta+(1-\beta)\left(1-\frac{p}{a\theta}\right)}{\beta+(1-\beta)\left(1-\frac{p}{a\theta}\right)(1-\theta)}},\qquad a^s_N=\frac{a}{a+(1-a)\frac{1}{1-\theta}}.aNn​=a+(1−a)β+(1−β)(1−aθp​)(1−θ)β+(1−β)(1−aθp​)​a​,aNs​=a+(1−a)1−θ1​a​.

These are the beliefs in terms of which Proposition 5's thresholds and ransoms are written.

Formalization Note The posteriors are post m 1 R of the setting, defined by Bayes' rule over the likelihood table; this theorem links them to the printed closed forms. The paper states a0d=aa^d_0=aa0d​=a in Step 2 of the proof of Proposition 5 (p. 42); the general form for all m∈[0,1]m\in[0,1]m∈[0,1] is Lemma 2's a0i=aa^i_0=aa0i​=a extended to the mechanism.

Preamble
import Mathlib
import Definitions.Def_ReviewBlackmail_SemiDec_Setting
Formal statement
namespace ReviewBlackmail.SemiDec
theorem eq5_posteriors (M : Model) (hM : M.Standing) :
    (∀ m ∈ Set.Icc (0 : ℝ) 1, M.post m 1 .Z = M.a) ∧
    M.post (M.γ * (1 - M.δ)) 1 .N =
      M.a / (M.a + (1 - M.a) *
        ((M.β * M.γ * (1 - M.δ) + (1 - M.β) * (1 - M.p / (M.a * M.θ))) /
          (M.β * M.γ * (1 - M.δ) + (1 - M.β) * (1 - M.p / (M.a * M.θ)) * (1 - M.θ)))) ∧
    M.post 1 1 .N =
      M.a / (M.a + (1 - M.a) *
        ((M.β + (1 - M.β) * (1 - M.p / (M.a * M.θ))) /
          (M.β + (1 - M.β) * (1 - M.p / (M.a * M.θ)) * (1 - M.θ)))) ∧
    M.post 0 1 .N = M.a / (M.a + (1 - M.a) * (1 / (1 - M.θ))) := 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. 21, §5.1, (5); p. 11, Lemma 2; p. 42, Proof of Proposition 5, Step 2, (22)
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