Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 8.1: in the RM duopoly game a firm's Littlewood protection level is nonincreasing in its rival's protection level, so its equilibrium graph has no crossing arcs

Proved
RevenueManagement.rm_duopoly_littlewood_monotone

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

duopolylittlewoodoperations-researchprotection-levelsrevenue-management

For any high-fare demands D1,D2D_1, D_2D1​,D2​ on a probability space and fares pH≥0p_H \ge 0pH​≥0, pLp_LpL​, if the rival protects more (y2≤y2′y_2 \le y_2'y2​≤y2′​) then a firm's Littlewood protection level against the effective demand D1+(D2−y2′)+D_1 + (D_2 - y_2')^+D1​+(D2​−y2′​)+ is at most its level against D1+(D2−y2)+D_1 + (D_2 - y_2)^+D1​+(D2​−y2​)+. In the book's indexing, where firm 2's node jjj means protecting C−jC - jC−j units, this says the best-response arcs (k2,k1)(k_2, k_1)(k2​,k1​), (l2,l1)(l_2, l_1)(l2​,l1​) with l2>k2l_2 > k_2l2​>k2​ never have l1<k1l_1 < k_1l1​<k1​: no crossing arcs.

Preamble
import Definitions.Def_RevenueManagement_competition
Formal statement
namespace RevenueManagement

variable {Ω : Type*} [MeasurableSpace Ω]

theorem rm_duopoly_littlewood_monotone (P : MeasureTheory.Measure Ω)
    [MeasureTheory.IsProbabilityMeasure P] (D1 D2 : Ω → ℕ)
    (pL pH : ℝ) (hpH : 0 ≤ pH) (C y2 y2' : ℕ) (h : y2 ≤ y2') :
    littlewoodResponse P (spilloverDemand D1 D2 y2') pL pH C ≤
      littlewoodResponse P (spilloverDemand D1 D2 y2) pL pH C := 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. 381, Proposition 8.1 (proof in Appendix 8.A p. 404: 'If firm 2 chooses l2 (that is, protects less for its H demand), then firm 1 should see more of a spillover of firm 2 H demand ... So by Littlewood's rule, its protection level should increase')
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