Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10, p. 24 — with γ_i ≤ 1, the optimum (x̂, ŷ) of (4) over {Ŝ_i(ϵ_i)} ∪ {{j}} gives (2x̂, 2ŷ) feasible for (3)

Proved
NestedLogitVariants.PartialCompetitive.theorem_10

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

approximation-algorithmsassortment-optimizationlinear-programmingnested-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider a nested logit instance in which every dissimilarity parameter satisfies γi≤1\gamma_i \le 1γi​≤1, while the within-nest no-purchase weights vi0≥0v_{i0} \ge 0vi0​≥0 are arbitrary. For each nest iii take as candidate assortments the greedy assortments of the continuous knapsack problem together with the singletons,

{S^i(ϵi):ϵi∈[0,∞]}∪{{j}:j∈N},\{\hat S_i(\epsilon_i) : \epsilon_i \in [0, \infty]\} \cup \{\{j\} : j \in N\},{S^i​(ϵi​):ϵi​∈[0,∞]}∪{{j}:j∈N},

and let (x^,y^)(\hat x, \hat y)(x^,y^​) be an optimal solution of the linear program (4) restricted to these candidates. Then (2x^,2y^)(2\hat x, 2\hat y)(2x^,2y^​) is feasible for the full linear program (3):

v0 2x^≥∑i∈M2y^i,2y^i≥Vi(Si)γi(Ri(Si)−2x^)∀Si⊆N, i∈M.v_0\, 2\hat x \ge \sum_{i \in M} 2\hat y_i, \qquad 2\hat y_i \ge V_i(S_i)^{\gamma_i}\big(R_i(S_i) - 2\hat x\big) \quad \forall S_i \subseteq N,\ i \in M.v0​2x^≥i∈M∑​2y^​i​,2y^​i​≥Vi​(Si​)γi​(Ri​(Si​)−2x^)∀Si​⊆N, i∈M.

Combined with Theorem 1 of the paper, this yields a factor-two approximation for assortment optimization under the nested logit model with partially-captured nests, where the exact problem is NP-hard, using a linear program with polynomially many constraints.

Formalization Note An optimal solution of (4) is a feasible pair whose xxx is no larger than that of any feasible pair. 2y^2\hat y2y^​ is the componentwise double of y^\hat yy^​. The value ϵi=∞\epsilon_i = \inftyϵi​=∞ of the candidate collection is represented by real capacities, since every capacity at least ∑jvij\sum_j v_{ij}∑j​vij​ already gives S^i=N\hat S_i = NS^i​=N.


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_PartialCompetitive_Model
import Definitions.Def_NestedLogitVariants_PartialCompetitive_Knapsack
Formal statement
namespace NestedLogitVariants.PartialCompetitive

/-- Theorem 10, p. 24: with dissimilarity parameters at most one, if `(x̂, ŷ)` is an optimal
solution of (4) with the candidate collections `{Ŝ_i(ε) : ε ∈ [0, ∞]} ∪ {{j} : j ∈ N}`, then
`(2 x̂, 2 ŷ)` is feasible for (3). -/
theorem theorem_10 {ι : Type*} [Fintype ι] [DecidableEq ι] {n : ℕ} (I : Instance ι n)
    (hI : I.Standing)
    (hγ : ∀ i, I.γ i ≤ 1)
    (xh : ℝ) (yh : ι → ℝ) (hopt : LP4Optimal I (candidates I) xh yh) :
    LP3Feasible I (2 * xh) (2 • yh) := by sorry

end NestedLogitVariants.PartialCompetitive
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. 24, Theorem 10 (proof in Appendix A.3, pp. 45–46)
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