Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.2 — revenue-ordered assortments earn OPT/∑i(ri−ri−1)/ri≥OPT/(1+ln⁡(rk/r1))\mathrm{OPT}/\sum_{i}(r_i-r_{i-1})/r_i\ge\mathrm{OPT}/(1+\ln(r_k/r_1))OPT/∑i​(ri​−ri−1​)/ri​≥OPT/(1+ln(rk​/r1​))

Proved
RevenueOrdered.UDPmin.revenue_ordered_ratio_bound

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

approximation-algorithmsassortment-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management

Let P\mathcal PP be a regular discrete choice model on a finite nonempty product set C\mathcal CC, and r:C→R>0r:\mathcal C\to\mathbb R_{>0}r:C→R>0​ a revenue function whose distinct values are 0<r1<⋯<rk0<r_1<\dots<r_k0<r1​<⋯<rk​; put r0:=0r_0:=0r0​:=0. Then the revenue-ordered value RO=max⁡irev(Si)\mathrm{RO}=\max_{i}\mathrm{rev}(S_i)RO=maxi​rev(Si​), Si={x:r(x)≥ri}S_i=\{x:r(x)\ge r_i\}Si​={x:r(x)≥ri​}, satisfies

OPT ≤ (∑i=1kri−ri−1ri)⋅ROand∑i=1kri−ri−1ri ≤ 1+ln⁡rkr1.\mathrm{OPT}\ \le\ \Big(\sum_{i=1}^k\frac{r_i-r_{i-1}}{r_i}\Big)\cdot\mathrm{RO}\qquad\text{and}\qquad \sum_{i=1}^k\frac{r_i-r_{i-1}}{r_i}\ \le\ 1+\ln\frac{r_k}{r_1}.OPT ≤ (i=1∑k​ri​ri​−ri−1​​)⋅ROandi=1∑k​ri​ri​−ri−1​​ ≤ 1+lnr1​rk​​.

That is, revenue-ordered assortments approximate the optimum to within a factor 1/∑i=1k(ri−ri−1)/ri ≥ 1/(1+ln⁡ρ)1/\sum_{i=1}^k (r_i-r_{i-1})/r_i\ \ge\ 1/(1+\ln\rho)1/∑i=1k​(ri​−ri−1​)/ri​ ≥ 1/(1+lnρ), ρ=rk/r1\rho=r_k/r_1ρ=rk​/r1​.

This is the guarantee that Corollary 4.7 transfers to uniform pricing through Theorem 4.6.

Formalization Note The approximation factor is stated in product form, OPT≤D⋅RO\mathrm{OPT}\le D\cdot\mathrm{RO}OPT≤D⋅RO, rather than as a ratio. This item restates, for this mission's own copy of the model, the goal theorem of mission I of the series (RevenueOrdered.Ratio.revenue_ordered_ratio_bound).

Preamble
import Mathlib
import Definitions.Def_RevenueOrdered_UDPmin_Model
Formal statement
namespace RevenueOrdered.UDPmin

/-- Theorem 3.2 (Berbeglia–Joret, arXiv:1606.01371v3, p. 8), for an arbitrary regular choice
model: `OPT ≤ (∑_{i=1}^{k} (r_i − r_{i−1})/r_i) · RO` and `∑_{i=1}^{k} (r_i − r_{i−1})/r_i ≤
1 + ln(r_k/r_1)`, with `r_0 := 0`. -/
theorem revenue_ordered_ratio_bound {C : Type*} [Fintype C] [DecidableEq C] [Nonempty C]
    (P : C → Finset C → ℝ) (hP : IsRegular P) (r : C → ℝ) (hr : ∀ x, 0 < r x) :
    RevenueOrdered.Ratio.opt P r ≤ ratioSum r * ro P r ∧
    ratioSum r ≤ 1 + Real.log (rMax r / rMin r) := by sorry

end RevenueOrdered.UDPmin
Source
Berbeglia & Joret, Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments, arXiv:1606.01371v3, p. 8, Theorem 3.2 (proof pp. 8–9)
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