Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6.1: when capacity is unconstrained (N ≤ C), a fixed list price p* with J(p*) = 0 is an optimal mechanism

Proved
RevenueManagement.list_price_unconstrained_optimal

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

auctionslist-pricemechanism-designoperations-researchoptimal-auction

In the private-value CCC-unit model with N≤CN \le CN≤C customers, regular valuations and a strictly increasing virtual value with zero v∗v^*v∗, the list-price mechanism at the price p∗=v∗p^* = v^*p∗=v∗ (every customer with valuation above p∗p^*p∗ buys at p∗p^*p∗) earns at least the expected revenue of every feasible, incentive-compatible mechanism with monotone allocations and zero surplus at zero: it is an optimal mechanism for the firm.

Preamble
import Definitions.Def_RevenueManagement_auctions
Formal statement
namespace RevenueManagement

theorem list_price_unconstrained_optimal (V : PrivateValues) (hV : V.IsRegular)
    (hJ : StrictMonoOn (virtualValue V) (Set.Icc 0 V.vbar)) (C : ℕ) (hNC : V.N ≤ C) (vstar : ℝ)
    (hvs : vstar ∈ Set.Icc 0 V.vbar) (hJ0 : virtualValue V vstar = 0) (M : Mechanism V.N)
    (hM : M.IsFeasible C V.vbar) (hmono : HasMonotoneAllocation V M) (hzero : HasZeroSurplusAtZero V M)
    (hic : IsIncentiveCompatible V M) :
    expRevenue V M ≤ expRevenue V (listPrice V.N vstar) := 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. 263, Proposition 6.1 and Sect. 6.2.6.1
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