Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.3: with a convex denied-service cost, stochastically larger demand to come gives greatest optimal overbooking limits that are no larger

Disproved
RevenueManagement.overbooking_limits_demand

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

operations-researchoverbookingrevenue-managementstochastic-order

In the dynamic overbooking model with a convex denied-service cost, let f′f'f′ be a second family of demand pmfs with Dt′D'_tDt′​ stochastically larger than DtD_tDt​ in every period, that is P(Dt≥k)≤P(Dt′≥k)\mathbb P(D_t \ge k) \le \mathbb P(D'_t \ge k)P(Dt​≥k)≤P(Dt′​≥k) for all ttt and kkk. Then the greatest optimal overbooking limit of the model with demands D′D'D′ is at most that of the model with demands DDD, in every period 1≤t≤T1 \le t \le T1≤t≤T. This is the book's statement with the parametrized family Dt(θ)D_t(\theta)Dt​(θ), stochastically increasing in θ\thetaθ, replaced by two of its members.


Retired. Retired because the demand pmfs were not required to have finite means, so the tsum expectation in valueGo collapsed to 0 for a heavy-tailed demand and the comparison reversed (accepted disproof); replaced by RevenueManagement.overbooking_limits_demand_v2 with finite-mean hypotheses.

Preamble
import Definitions.Def_RevenueManagement_overbooking
Formal statement
namespace RevenueManagement

theorem overbooking_limits_demand (M : DynOverbooking) (hM : M.IsModel) (hc : IsConvexSeq M.c)
    (f' : ℕ → ℕ → ℝ) (hf' : ∀ t, (∀ d, 0 ≤ f' t d) ∧ HasSum (f' t) 1)
    (hst : ∀ t k, ∑' d, (if k ≤ d then M.f t d else 0) ≤ ∑' d, (if k ≤ d then f' t d else 0))
    (t : ℕ) (ht : 1 ≤ t) (htT : t ≤ M.T) :
    ({ M with f := f' } : DynOverbooking).overbookingLimit t ≤ M.overbookingLimit t := by sorry

end RevenueManagement
Source
Kalyan T. Talluri and Garrett J. van Ryzin, The Theory and Practice of Revenue Management, Kluwer/Springer 2004, DOI 10.1007/b139000, pp. 153-154, Proposition 4.3 ('as demand to come increases (stochastically), it is better to be less aggressive in overbooking')
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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