§5.1, p. 21 — a^s_N < a^d_N < a^n_N
ProvedReviewBlackmail.SemiDec.posterior_orderbayesian-updatingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1posterior-beliefreview-blackmail
Under the standing assumptions of the semi-decentralized model, suppose that the probability with which a malicious review removed through the mechanism is reinstated satisfies . Then the posteriors after a negative review are strictly ordered:
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 are added: at one has and at one has , 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.