Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 9, PDF p. 29 — the SMR optimum of Theorem 6 earns at least half the optimal revenue of the SQR joint problem (15)

Proved
MultiStoreAssort.Pricing.proposition9_half

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

approximation-ratioassortment-optimizationjoint-pricingmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sequential-recommendation

In the setting of Theorem 6 (λi≥0\lambda_i\ge0λi​≥0, ∑iλi=1\sum_i\lambda_i=1∑i​λi​=1, αik>0\alpha_{ik}>0αik​>0, βik>0\beta_{ik}>0βik​>0, cijk≥0c^k_{ij}\ge0cijk​≥0, ciik=0c^k_{ii}=0ciik​=0, and θi∗\theta^*_iθi∗​ the solution of the markup equation), consider the joint problem under sequential recommendation, whose objective is RQ(S,P)R^Q(\mathbf S,\mathbf P)RQ(S,P) of (15): a store-iii customer first sees SiS_iSi​, and only if she buys nothing is she shown Sˉ∖Si\bar S\setminus S_iSˉ∖Si​.

Proposition 9. The optimal solution (S∗,P∗)(\mathbf S^*,\mathbf P^*)(S∗,P∗) of problem (13) from Theorem 6, namely Si∗=NS^*_i=\mathcal NSi∗​=N and pik∗=θi∗+1/βikp^*_{ik}=\theta^*_i+1/\beta_{ik}pik∗​=θi∗​+1/βik​, achieves at least half of the optimal revenue of (15): for every profile S\mathbf SS, every real price matrix P\mathbf PP and every best-store rule lll,

RQ(S,P) ≤ 2 RQ(S∗,P∗).R^Q(\mathbf S,\mathbf P)\ \le\ 2\,R^Q(\mathbf S^*,\mathbf P^*).RQ(S,P) ≤ 2RQ(S∗,P∗).

The single-store optimal solution is therefore a 12\tfrac1221​-approximation for the joint assortment and pricing problem under sequential recommendation, extending Proposition 7 of the paper to endogenous prices.

Formalization Note "The optimal solution to problem (13)" is read as the solution constructed in Theorem 6 (the proof in App. E.2 bounds the optimal value of (15) by twice ∑iλiθi∗\sum_i\lambda_i\theta^*_i∑i​λi​θi∗​, which is what that solution earns in (15)). "The optimal revenue in (15)" is expressed as a bound over all profiles, real prices and tie-breaking rules, not through a supremum.

Preamble
import Mathlib
import Definitions.Def_MultiStoreAssort_Pricing_Model
Formal statement
namespace MultiStoreAssort.Pricing
open Finset

theorem proposition9_half {m n : ℕ} (lam : Fin m → ℝ) (α β : Fin m → Fin n → ℝ)
    (c : Fin m → Fin m → Fin n → ℝ) (hlam : ∀ i, 0 ≤ lam i) (hlam1 : ∑ i, lam i = 1)
    (hα : ∀ i k, 0 < α i k) (hβ : ∀ i k, 0 < β i k) (hc : ∀ i j k, 0 ≤ c i j k)
    (hcii : ∀ i k, c i i k = 0) (θ : Fin m → ℝ) (hθ : ∀ i, IsTheta (α i) (β i) (θ i)) :
    ∀ (S : Fin m → Finset (Fin n)) (P : Fin m → Fin n → ℝ) (l l' : Fin m → Fin n → Fin m),
      IsBestStore α β c P S l →
        rev15 lam α β c S P l ≤
          2 * rev15 lam α β c (fun _ => Finset.univ) (fun i k => θ i + 1 / β i k) l' := by sorry

end MultiStoreAssort.Pricing
Source
Liu, Chen, Liu & Wan, Simultaneous vs. Sequential: Optimal Assortment Recommendation in Multistore Retailing, authors' manuscript with Online and Additional Supplements (2024-09-17; MSOM DOI 10.1287/msom.2024.0761), PDF p. 29, Proposition 9; proof Online Supplement App. E.2, PDF p. 48
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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