Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1, p. 21 — a^s_N < a^d_N < a^n_N

Proved
ReviewBlackmail.SemiDec.posterior_order

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, suppose that the probability γ(1−δ)\gamma(1-\delta)γ(1−δ) with which a malicious review removed through the mechanism is reinstated satisfies 0<γ(1−δ)<10<\gamma(1-\delta)<10<γ(1−δ)<1. Then the posteriors after a negative review are strictly ordered:

aNs<aNd<aNn.a^s_N<a^d_N<a^n_N.aNs​<aNd​<aNn​.

A negative review is least informative of low quality when the seller is believed to ignore blackmail (it may be the blackmailer's), most informative when he is believed to settle (it must be genuine), and in between under the mechanism. The ordering is what makes the ransom thresholds of Proposition 5 comparable.

Formalization Note The bounds 0<γ(1−δ)<10<\gamma(1-\delta)<10<γ(1−δ)<1 are added: at γ(1−δ)=0\gamma(1-\delta)=0γ(1−δ)=0 one has aNd=aNsa^d_N=a^s_NaNd​=aNs​ and at γ(1−δ)=1\gamma(1-\delta)=1γ(1−δ)=1 one has aNd=aNna^d_N=a^n_NaNd​=aNn​, so the strict ordering the paper states needs both.

Preamble
import Mathlib
import Definitions.Def_ReviewBlackmail_SemiDec_Setting
Formal statement
namespace ReviewBlackmail.SemiDec
theorem posterior_order (M : Model) (hM : M.Standing)
    (h0 : 0 < M.γ * (1 - M.δ)) (h1 : M.γ * (1 - M.δ) < 1) :
    M.post 0 1 .N < M.post (M.γ * (1 - M.δ)) 1 .N ∧
      M.post (M.γ * (1 - M.δ)) 1 .N < M.post 1 1 .N := 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, after (5)
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