Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4, p. 15 — with γ_i ≤ 1 and v_i0 = 0, some optimal assortment has S_i* = N_ij in every nest

Proved
NestedLogitVariants.Competitive.theorem_4

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

assortment-optimizationnested-by-revenuenested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management

Consider the nested logit assortment problem (2) in which every nest is fully captured, vi0=0v_{i0} = 0vi0​=0 for all i∈Mi \in Mi∈M, and every dissimilarity parameter satisfies γi≤1\gamma_i \le 1γi​≤1. Products in each nest are ordered by revenue, ri1≥⋯≥rinr_{i1} \ge \dots \ge r_{in}ri1​≥⋯≥rin​, and Nij={1,…,j}N_{ij} = \{1, \dots, j\}Nij​={1,…,j} denotes the nested-by-revenue assortment of the jjj highest-revenue products of nest iii, with Ni0=∅N_{i0} = \emptysetNi0​=∅ and N+={0,1,…,n}N_+ = \{0, 1, \dots, n\}N+​={0,1,…,n}. Then there exists an optimal solution (S1∗,…,Sm∗)(S^*_1, \dots, S^*_m)(S1∗​,…,Sm∗​) to problem (2) such that

Si∗=Nijfor some j∈N+,for all i∈M.S^*_i = N_{ij} \quad \text{for some } j \in N_+, \qquad \text{for all } i \in M.Si∗​=Nij​for some j∈N+​,for all i∈M.

This is the main structural result of the paper for competitive products and fully-captured nests: the search for an optimal assortment can be restricted to the (n+1)m(n+1)^m(n+1)m combinations of nested-by-revenue assortments, and the paper then finds the best combination with a linear program with 1+m1 + m1+m variables.

Formalization Note The standing assumptions of §3 (p. 13), γi≤1\gamma_i \le 1γi​≤1 and vi0=0v_{i0} = 0vi0​=0, are hypotheses, together with those of §1 and the pins of the model definition (vij>0v_{ij} > 0vij​>0, rij≥0r_{ij} \ge 0rij​≥0, γi>0\gamma_i > 0γi​>0, revenues ordered). The no-nest weight is only assumed nonnegative, v0≥0v_0 \ge 0v0​≥0: the section assumes v0>0v_0 > 0v0​>0 "without loss of generality", and the case v0=0v_0 = 0v0​=0 is covered by the paper's remark that offering the single highest-revenue product is then optimal. Products are indexed 0,…,n−10, \dots, n-10,…,n−1 and NijN_{ij}Nij​ is nbr n j ={k:k<j}= \{k : k < j\}={k:k<j} with j≤nj \le nj≤n; j=0j = 0j=0 gives the empty assortment. The statement asserts that some optimal assortment is nested by revenue, not that every optimal assortment is (which fails under ties).


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

Preamble
import Mathlib
import Definitions.Def_NestedLogitVariants_Competitive_Model
Formal statement
namespace NestedLogitVariants.Competitive

/-- Theorem 4, p. 15: with `γ_i ≤ 1` and `v_{i0} = 0` for all nests, there exists an optimal
solution `(S*_1, …, S*_m)` to problem (2) such that, for all `i ∈ M`, `S*_i = N_ij` for some
`j ∈ N_+ = {0, 1, …, n}`. -/
theorem theorem_4 {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n) (hI : I.Standing)
    (hγ : ∀ i, I.γ i ≤ 1) (hfc : ∀ i, I.vnp i = 0) :
    ∃ S : ι → Finset (Fin n), IsOptimal I S ∧ ∀ i, ∃ j ≤ n, S i = nbr n j := by sorry

end NestedLogitVariants.Competitive
Source
Davis, Gallego, Topaloglu, Assortment optimization under variants of the nested logit model, revised manuscript of June 18, 2013 (published Oper. Res. 62(2), 2014, DOI 10.1287/opre.2014.1256), p. 15, Theorem 4
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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