Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

App. E.1, PDF p. 47 — under SMR, each store's revenue is at most the single-store optimum θ*ᵢ

Proved
MultiStoreAssort.Pricing.storewise_bound

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

joint-pricingmultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simultaneous-recommendation

Consider the multistore joint pricing model under simultaneous recommendation, with αik>0\alpha_{ik}>0αik​>0, βik>0\beta_{ik}>0βik​>0, discounts cijk≥0c^k_{ij}\ge 0cijk​≥0 and ciik=0c^k_{ii}=0ciik​=0, and let θi∗\theta^*_iθi∗​ solve θi∗=∑k∈Neα^ik−βikθi∗\theta^*_i=\sum_{k\in\mathcal N}e^{\hat\alpha_{ik}-\beta_{ik}\theta^*_i}θi∗​=∑k∈N​eα^ik​−βik​θi∗​ with α^ik=αik−log⁡βik−1\hat\alpha_{ik}=\alpha_{ik}-\log\beta_{ik}-1α^ik​=αik​−logβik​−1. For every assortment profile S\mathbf SS, every real price matrix P\mathbf PP, every best-store rule lll for (S,P)(\mathbf S,\mathbf P)(S,P) and every store iii,

∑k∈Sipikvik+∑k∈Sˉ∖Sip~ik(S)v~ik(S)1+∑k∈Sivik+∑k∈Sˉ∖Siv~ik(S) ≤ θi∗.\frac{\sum_{k\in S_i}p_{ik}v_{ik}+\sum_{k\in\bar S\setminus S_i}\tilde p_{ik}(\mathbf S)\tilde v_{ik}(\mathbf S)}{1+\sum_{k\in S_i}v_{ik}+\sum_{k\in\bar S\setminus S_i}\tilde v_{ik}(\mathbf S)}\ \le\ \theta^*_i.1+∑k∈Si​​vik​+∑k∈Sˉ∖Si​​v~ik​(S)∑k∈Si​​pik​vik​+∑k∈Sˉ∖Si​​p~​ik​(S)v~ik​(S)​ ≤ θi∗​.

The expected revenue of store iii under (13) never exceeds the optimal value of the single-store problem (14) with that store's parameters. Summing with the weights λi\lambda_iλi​ gives the upper bound in Theorem 6.

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

theorem storewise_bound {m n : ℕ} (α β : Fin m → Fin n → ℝ) (c : Fin m → Fin m → Fin n → ℝ)
    (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 : Fin m → Fin n → Fin m)
    (hl : IsBestStore α β c P S l) (i : Fin m) :
    storeRev13 α β c S P l i ≤ θ i := 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), Online Supplement App. E.1, proof of Theorem 6, PDF p. 47
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