Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 8.3 (Talluri): when both firms are in Case I, or both in Case II, the one-period MNL offer-set duopoly game has a pure-strategy equilibrium in complete offer sets

Proved
RevenueManagement.mnl_offer_set_equilibrium

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

discrete-choiceduopolynash-equilibriumoffer-setsoperations-researchrevenue-management

Two firms with MNL fare products (positive weights, prices decreasing in the product index) and a no-purchase weight w0>0w_0 > 0w0​>0 compete in one period of the dynamic game (8.31): firm 1 offering its first kkk products against firm 2's first lll earns g1(Ck)/(W1(k)+W2(l)+w0)g_1(C_k)/(W_1(k) + W_2(l) + w_0)g1​(Ck​)/(W1​(k)+W2​(l)+w0​), with gi(Ck)=∑j∈Ckwji(pji−Δi)−w0δig_i(C_k) = \sum_{j \in C_k} w^i_j(p^i_j - \Delta_i) - w_0\delta_igi​(Ck​)=∑j∈Ck​​wji​(pji​−Δi​)−w0​δi​, and firm 2 symmetrically. If both firms are in Case I (gi(G∗)≥0g_i(G^*) \ge 0gi​(G∗)≥0) or both in Case II (gi<0g_i < 0gi​<0 on every complete set), there is a pure-strategy Nash equilibrium (Ck,Cl)(C_k, C_l)(Ck​,Cl​) in complete offer sets. The mixed case can fail (Example 8.18).

Preamble
import Definitions.Def_RevenueManagement_competition
Formal statement
namespace RevenueManagement

theorem mnl_offer_set_equilibrium (A B : OfferFirm) (w0 : ℝ) (hw0 : 0 < w0) (hA : A.IsModel)
    (hB : B.IsModel) (hcase : (A.CaseI w0 ∧ B.CaseI w0) ∨ (A.CaseII w0 ∧ B.CaseII w0)) :
    ∃ k l, IsOfferEquilibrium A B w0 k l := 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. 399, Proposition 8.3 ('When both firms are in Case I, or both are in Case II, there exists an equilibrium in offer sets'), proof in Appendix 8.A pp. 404-405, from Talluri [503]
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