Proposition 4 — optimal prices and discount time with myopic customers and identical declining valuations
ProvedSeasonalPricing.MyopicDet.optimal_prices_and_discount_timeA seller with unlimited inventory sells a seasonal product over the season . Customers arrive as a Poisson process with rate ; every customer has base valuation (coefficient of variation ), and a customer's valuation at time is for a fixed . The seller posts a premium price until a discount time and a discount price afterwards. Customers are myopic: one arriving at time buys at once iff , otherwise waits and buys at iff ; one arriving after buys iff the current valuation is at least . Let be the expected revenue, and
- The problem has a maximum , and
moreover, for every maximizer of on the region and every with , . 2. If , then the maximizer is unique, , , the optimal revenue is , and every with
gives .
The result says that with identical, declining valuations the seller segments customers by arrival time alone: early arrivals pay the premium price, later ones the discount, and the discount time can be placed anywhere in a whole interval without loss.
Formalization Note The paper's "Q/λ → ∞" is read as unlimited inventory. Prices in the revenue maximization range over all and discount times over ; the restriction to is part of the conclusion, not an assumption. "Setting to any value within the range " is read as: every such is optimal (not: only such ). "If one could, it would be optimal to select so that " is read the same way, at the explicit prices. Such automatically lie in . Uniqueness in part 2 is the reading of "the prices and ". The decimal approximations and are not stated.
import Mathlib import Definitions.Def_SeasonalPricing_MyopicDet_myopicRevenue import Definitions.Def_SeasonalPricing_MyopicDet_reducedObjective
namespace SeasonalPricing.MyopicDet
/-- Proposition 4 (Aviv–Pazgal 2008, p. 351). Myopic customers, identical base valuations
`V = 1` (`c = 0`), `0 < ρ < 1` (`α = −ln ρ`, `H = 1`), unlimited inventory (`Q/λ → ∞`),
and the discount time `T ∈ [0, 1]` chosen by the seller together with the prices.
(a) The problem `max_{ρ ≤ p₂ ≤ p₁ ≤ 1} G(p₁, p₂)`, `G = (p₁ − p₂) ln(p₁)/ln(ρ) + p₂ ln(p₂)/ln(ρ)`,
has a maximum `M`; `λM` is the maximal expected revenue over all prices `0 < p₂ ≤ p₁` and
discount times `T ∈ [0, 1]`; and every maximizer `(p₁*, p₂*)` of `G` together with every `T`
with `p₂* ≤ ρ^T ≤ p₁*` attains it.
(b) If `ρ ≤ e^{−2+e^{−1}}`, the maximizer is unique, `p₁* = e^{−1+e^{−1}}`, `p₂* = p₁*/e`, the
optimal revenue is `π*_{C/N} = −λ e^{−1+e^{−1}}/ln(ρ)`, and every `T` with
`ρ^T ∈ [e^{−2+e^{−1}}, e^{−1+e^{−1}}]` attains it at these prices. -/
theorem optimal_prices_and_discount_time (lam ρ : ℝ) (hlam : 0 < lam) (hρ0 : 0 < ρ)
(hρ1 : ρ < 1) :
(∃ M : ℝ,
IsGreatest {g : ℝ | ∃ p1 p2 : ℝ, ρ ≤ p2 ∧ p2 ≤ p1 ∧ p1 ≤ 1 ∧
g = reducedObjective ρ p1 p2} M ∧
IsGreatest {r : ℝ | ∃ p1 p2 T : ℝ, 0 < p2 ∧ p2 ≤ p1 ∧ 0 ≤ T ∧ T ≤ 1 ∧
r = detRevenue lam ρ p1 p2 T} (lam * M) ∧
∀ p1 p2 : ℝ, ρ ≤ p2 → p2 ≤ p1 → p1 ≤ 1 → reducedObjective ρ p1 p2 = M →
∀ T : ℝ, p2 ≤ ρ ^ T → ρ ^ T ≤ p1 → detRevenue lam ρ p1 p2 T = lam * M) ∧
(ρ ≤ Real.exp (-2 + Real.exp (-1)) →
IsGreatest {g : ℝ | ∃ p1 p2 : ℝ, ρ ≤ p2 ∧ p2 ≤ p1 ∧ p1 ≤ 1 ∧
g = reducedObjective ρ p1 p2} (-Real.exp (-1 + Real.exp (-1)) / Real.log ρ) ∧
(∀ p1 p2 : ℝ, ρ ≤ p2 → p2 ≤ p1 → p1 ≤ 1 →
reducedObjective ρ p1 p2 = -Real.exp (-1 + Real.exp (-1)) / Real.log ρ →
p1 = Real.exp (-1 + Real.exp (-1)) ∧
p2 = Real.exp (-1 + Real.exp (-1)) / Real.exp 1) ∧
IsGreatest {r : ℝ | ∃ p1 p2 T : ℝ, 0 < p2 ∧ p2 ≤ p1 ∧ 0 ≤ T ∧ T ≤ 1 ∧
r = detRevenue lam ρ p1 p2 T} (-lam * Real.exp (-1 + Real.exp (-1)) / Real.log ρ) ∧
∀ T : ℝ, Real.exp (-2 + Real.exp (-1)) ≤ ρ ^ T → ρ ^ T ≤ Real.exp (-1 + Real.exp (-1)) →
detRevenue lam ρ (Real.exp (-1 + Real.exp (-1)))
(Real.exp (-1 + Real.exp (-1)) / Real.exp 1) T =
-lam * Real.exp (-1 + Real.exp (-1)) / Real.log ρ) := by sorry
end SeasonalPricing.MyopicDet
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.