Proof of Proposition 1, p. 30 — the price pair p1 = vHL, p2 = vL is never optimal
ProvedDynOpaque.TwoPeriod.case_vHL_vL_dominatedopaque-sellingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1probabilistic-selling
Assume , , , . For every there is with
where the left side is objective (4) and is objective (3).
In words: whatever the firm earns with the price pair , it earns at least as much either with or with the best transparent policy. This is the first step of the paper's proof of Proposition 1.
Formalization Note "Never optimal" is formalized as weak domination; at boundary parameter values the two sides can be equal.
Preamble
import Mathlib import Definitions.Def_DynOpaque_TwoPeriod_Model
Formal statement
namespace DynOpaque.TwoPeriod
/-- Proof of Proposition 1, p. 30: the case `p₁ = vHL`, `p₂ = vL` is never optimal — every
value of objective (4) on the box is at most the larger of some value of objective (3) on the box
and the best transparent profit `2 max{vH − cH, vL − cL}`. -/
theorem case_vHL_vL_dominated (vH vL cH cL α : ℝ) (hS : Standing vH vL cH cL α) :
∀ x ∈ box, ∃ y ∈ box,
obj4 vH vL cH cL x.1 x.2 ≤ max (obj3 vH vL cH cL α y.1 y.2) (2 * max (vH - cH) (vL - cL)) := by sorry
end DynOpaque.TwoPeriod
Source
Huang and Yin, Dynamic Probabilistic Selling When Customers Have Boundedly Rational Expectations, SSRN manuscript 3627927, p. 30, proof of Proposition 1, first paragraph
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.