Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.2: if qₜ(p(t) − p(t+1)) + (1 − qₜ)(p(t) − r(t)) ≥ 0, the greatest optimal overbooking limits decline with time, x*(1) ≥ x*(2) ≥ ··· ≥ x*(T)

Proved
RevenueManagement.overbooking_limits_decline

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

monotone-policiesoperations-researchoverbookingrevenue-management

In the dynamic overbooking model with a convex denied-service cost, if the survival probabilities, revenues and refunds satisfy qt (p(t)−p(t+1))+(1−qt) (p(t)−r(t))≥0q_t\,(p(t) - p(t+1)) + (1 - q_t)\,(p(t) - r(t)) \ge 0qt​(p(t)−p(t+1))+(1−qt​)(p(t)−r(t))≥0 for 1≤t<T1 \le t < T1≤t<T, then the greatest optimal overbooking limits decline with time: x∗(t+1)≤x∗(t)x^*(t+1) \le x^*(t)x∗(t+1)≤x∗(t) for every 1≤t<T1 \le t < T1≤t<T, in N∪{∞}\mathbb N \cup \{\infty\}N∪{∞}. The condition holds in particular when revenues decrease over time and refunds do not exceed the current price.

Preamble
import Definitions.Def_RevenueManagement_overbooking
Formal statement
namespace RevenueManagement

theorem overbooking_limits_decline (M : DynOverbooking) (hM : M.IsModel) (hc : IsConvexSeq M.c)
    (hcond : ∀ t, 1 ≤ t → t < M.T →
      0 ≤ M.q t * (M.p t - M.p (t + 1)) + (1 - M.q t) * (M.p t - M.r t))
    (t : ℕ) (ht : 1 ≤ t) (htT : t < M.T) :
    M.overbookingLimit (t + 1) ≤ 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, p. 153, Proposition 4.2 and its footnote
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