Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.16, pp. 33–34 — rev(S)\mathrm{rev}(S)rev(S) equals the Stackelberg revenue of pSp_SpS​

Proved
RevenueOrdered.Stackelberg.revenue_eq_stackRevenue_priceOfAssortment

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

assortment-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stackelberg-pricing

In the assortment instance built from a Stackelberg Matroid instance (M,R,B,c)(M,R,B,c)(M,R,B,c) (with an admissible ordering LLL of R∪CR\cup\mathcal CR∪C), let S⊆CS\subseteq\mathcal CS⊆C and let pSp_SpS​ be the price assignment

pS(e)={min⁡{q:(e,q)∈S}if some (e,q)∈S,+∞otherwise.p_S(e)=\begin{cases}\min\{q:(e,q)\in S\} & \text{if some }(e,q)\in S,\\ +\infty&\text{otherwise.}\end{cases}pS​(e)={min{q:(e,q)∈S}+∞​if some (e,q)∈S,otherwise.​

Then for every ordering L∗L^*L∗ of R∪BR\cup BR∪B that the customer may use under pSp_SpS​ (compatible with the costs and prices, blue first on ties),

∑y∈SP(y,S) r(y)=∑e∈B∩greedyM(R∪B,L∗)pS(e).\sum_{y\in S}\mathcal P(y,S)\,r(y)=\sum_{e\in B\cap\mathrm{greedy}_M(R\cup B,L^*)}p_S(e).y∈S∑​P(y,S)r(y)=e∈B∩greedyM​(R∪B,L∗)∑​pS​(e).

Consequently the optimum of the Stackelberg Matroid instance is at least the optimum of the assortment instance.

Formalization Note The price +∞+\infty+∞ is the real number abovePrice =1+∑f∈Rc(f)=1+\sum_{f\in R}c(f)=1+∑f∈R​c(f), strictly larger than every red cost; such a blue element is never bought because RRR contains a base.

Preamble
import Mathlib
import Definitions.Def_RevenueOrdered_Stackelberg_Model
import Definitions.Def_RevenueOrdered_Stackelberg_Greedy
import Definitions.Def_RevenueOrdered_Stackelberg_Instance
import Definitions.Def_RevenueOrdered_Stackelberg_Assortment

open Classical
Formal statement
namespace RevenueOrdered.Stackelberg

/-- Proof of Theorem 4.16, pp. 33–34 (Berbeglia–Joret, arXiv:1606.01371v3): the RevenueOrdered.Ratio.revenue of an
assortment `S ⊆ 𝒞` equals the Stackelberg RevenueOrdered.Ratio.revenue of the price assignment `p_S`
(`p_S(e) = min{q : (e, q) ∈ S}`, or `+∞` if there is no such pair), for every ordering the
customer may use under `p_S`. -/
theorem revenue_eq_stackRevenue_priceOfAssortment {α : Type*} (I : Instance α)
    (L : List (α ⊕ (α × ℝ))) (hL : IsAuxOrder I L) (S : Finset (Product I)) (L' : List α)
    (hL' : I.IsCustomerOrder (priceOfAssortment I S) L') :
    RevenueOrdered.Ratio.revenue (choiceProb I L) (prodRevenue I) S =
      I.stackRevenue (priceOfAssortment I S) L' := by sorry

end RevenueOrdered.Stackelberg
Source
Berbeglia & Joret, Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments, arXiv:1606.01371v3, pp. 33–34, proof of Theorem 4.16
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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