Eq. (10), p. 10 — the demand rate never exceeds the maximum market share times the market size, λ ≤ S̄Λ
ProvedDeliveryDisclosure.InfoEffort.eq_10boundlogit-demandmarket-sharep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Under the standing assumptions, let , and let be a plan with and . Then the demand rate is at most the maximum market share times the market size:
The bound holds because whenever , and . It is what makes the capacity condition (16) meaningful: the queue is stable at every plan.
Formalization Note The page calls a lower bound of (p. 9); it is an upper bound, and eq. (10) uses it as such. The shortest delivery time is .
Preamble
import Mathlib import Definitions.Def_DeliveryDisclosure_InfoEffort_Model
Formal statement
namespace DeliveryDisclosure.InfoEffort
/-- Eq. (10), p. 10: at every plan with `p ≥ c` and `t ≥ 0` the demand rate is at most
the maximum share times the market size, `λ(p, t, ϕ) ≤ S̄ Λ`. -/
theorem eq_10 (P : Params) (hP : Standing P) (p t ϕ : ℝ) (hϕ : ϕ ∈ Set.Icc (0 : ℝ) 1)
(hp : P.c ≤ p) (ht : 0 ≤ t) :
dem P p t ϕ ≤ Sbar P ϕ * P.Λ := by sorry
end DeliveryDisclosure.InfoEffort
Source
Leng, Becerril-Arreola, Parlar & Ferguson, Disclosing Delivery Performance Information (authors' preprint, April 2nd, 2023), p. 10, eq. (10); V̄ from p. 9
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.