Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4.7 — uniform pricing earns OPTUDP/(1+ln⁡(vm/v1))\mathrm{OPT}_{\mathrm{UDP}}/(1+\ln(v_m/v_1))OPTUDP​/(1+ln(vm​/v1​)) in UDPmin⁡\mathrm{UDP}_{\min}UDPmin​

Proved
RevenueOrdered.UDPmin.uniform_pricing_log_ratio_bound

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

approximation-algorithmsenvy-free-pricingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pricingrevenue-management

Consider a UDPmin⁡\mathrm{UDP}_{\min}UDPmin​ instance with items [n][n][n], m≥1m\ge 1m≥1 consumers, interest sets BiB_iBi​ and valuations 0<v1≤⋯≤vm0<v_1\le\dots\le v_m0<v1​≤⋯≤vm​. Let OPTUDP\mathrm{OPT}_{\mathrm{UDP}}OPTUDP​ be the supremum of the seller's revenue over all positive price assignments and UP\mathrm{UP}UP the supremum of the revenue over uniform prices q>0q>0q>0. Then

OPTUDP ≤ (1+ln⁡vmv1)⋅UP,\mathrm{OPT}_{\mathrm{UDP}}\ \le\ \Big(1+\ln\frac{v_m}{v_1}\Big)\cdot\mathrm{UP},OPTUDP​ ≤ (1+lnv1​vm​​)⋅UP,

that is, uniform pricing approximates the optimum revenue to within a factor of 1/(1+ln⁡ρ)1/(1+\ln\rho)1/(1+lnρ) with ρ:=vm/v1\rho:=v_m/v_1ρ:=vm​/v1​.

The bound depends only on the spread of the valuations, not on nnn or mmm; the paper obtains it by combining Theorem 4.6 with Theorem 3.2.

Formalization Note Valuations are positive (the paper says non-negative; ρ\rhoρ requires v1>0v_1>0v1​>0). vmv_mvm​ and v1v_1v1​ are the maximum and minimum valuations, so no sorting is assumed. The statement holds for any number of items, including none (both sides are then 000).

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

/-- Corollary 4.7 (Berbeglia–Joret, arXiv:1606.01371v3, p. 20): uniform pricing approximates the
optimum revenue of `UDP_min` to within a factor of `1/(1 + ln ρ)`, `ρ := v_m / v_1`, in product
form: `OPT_UDP ≤ (1 + ln(v_m / v_1)) · UP`. -/
theorem uniform_pricing_log_ratio_bound {X M : Type*} [Fintype X] [Fintype M] [Nonempty M]
    (I : Instance X M) :
    optUDP I ≤ (1 + Real.log (vMax I / vMin I)) * uniformRevenue I := 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. 20, Corollary 4.7
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