Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 14 — with v_0 = 0 and v_i0 = 0, offering only the highest-revenue product over all nests is optimal

Proved
NestedLogitVariants.Competitive.optimal_of_v0_eq_zero

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

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

Consider the nested logit assortment problem (2) in which no customer leaves without considering a nest, v0=0v_0 = 0v0​=0, and every nest is fully captured, vi0=0v_{i0} = 0vi0​=0 for all nests i∈Mi \in Mi∈M. Products in each nest are ordered by revenue, ri1≥ri2≥⋯≥rinr_{i1} \ge r_{i2} \ge \dots \ge r_{in}ri1​≥ri2​≥⋯≥rin​, and n≥1n \ge 1n≥1. Let i∈Mi \in Mi∈M be a nest whose top product has the largest revenue over all nests, ri1=max⁡l∈Mrl1r_{i1} = \max_{l \in M} r_{l1}ri1​=maxl∈M​rl1​. Then the assortment that offers only product 111 in nest iii and nothing in any other nest,

Si=Ni1={1},Sl=∅(l≠i),S_i = N_{i1} = \{1\}, \qquad S_l = \emptyset \quad (l \ne i),Si​=Ni1​={1},Sl​=∅(l=i),

is an optimal solution to problem (2).

This is the case that §3 sets aside with its "without loss of generality v0>0v_0 > 0v0​>0": in it, the conclusion of Theorem 4 holds directly, since the optimal assortment above is nested by revenue in every nest.

Formalization Note Products are indexed 0,…,n−10, \dots, n-10,…,n−1, so the paper's product 111 is index 000 and Ni1N_{i1}Ni1​ is nbr n 1. The hypothesis γi≤1\gamma_i \le 1γi​≤1 of §3 is not needed and is omitted, which makes the statement stronger. The paper's further remark that this product "would be purchased with probability one" is not stated. Standing assumptions and pins as in the model definition.

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

/-- §3, p. 14 (the case `v_0 = 0` set aside by the section's "without loss of generality"):
when `v_0 = 0` and `v_{i0} = 0` for every nest, offering only the product with the largest revenue
`max_{l ∈ M} r_{l1}` (here product `0` of nest `i`) and nothing in the other nests is optimal. -/
theorem optimal_of_v0_eq_zero {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n) (hI : I.Standing)
    (hfc : ∀ i, I.vnp i = 0) (hv0 : I.v0 = 0) (hn : 0 < n) (i : ι)
    (hi : ∀ l, I.r l ⟨0, hn⟩ ≤ I.r i ⟨0, hn⟩) :
    IsOptimal I (fun l => if l = i then nbr n 1 else ∅) := 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. 14, §3 (paragraph before Proposition 2)
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