Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 6, p. 23 — the MNL choice model has the nesting-by-fare-order property

Proved
ChoiceRM.MNL.proposition_6

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

discrete-choicemultinomial-logitp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1revenue-management

Let w1,…,wn>0w_1, \dots, w_n > 0w1​,…,wn​>0 be MNL preference weights (with no-purchase weight w0=1w_0 = 1w0​=1), and let

Pj(S)=wj∑i∈Swi+1,j∈S,Pj(S)=0,j∉S,P_j(S) = \frac{w_j}{\sum_{i\in S} w_i + 1}, \quad j \in S, \qquad P_j(S) = 0, \quad j \notin S,Pj​(S)=∑i∈S​wi​+1wj​​,j∈S,Pj​(S)=0,j∈/S,

be the MNL choice probabilities (14). Then this choice model has the nesting-by-fare-order property (Definition 4):

  1. the purchase probability Q(S)=∑j∈SPj(S)Q(S) = \sum_{j \in S} P_j(S)Q(S)=∑j∈S​Pj​(S) is increasing in SSS; and
  2. for all values x1≥x2≥⋯≥xnx_1 \ge x_2 \ge \dots \ge x_nx1​≥x2​≥⋯≥xn​, the problem max⁡S⊆N∑jxjPj(S)\max_{S \subseteq N} \sum_{j} x_j P_j(S)maxS⊆N​∑j​xj​Pj​(S) has an optimal solution that is a complete set Ak={1,…,k}A_k = \{1, \dots, k\}Ak​={1,…,k}, 0≤k≤n0 \le k \le n0≤k≤n.

By the theory of §§2–3 of the paper, this means that under MNL demand the optimal single-resource revenue management policy opens fares in fare order: a convex combination of the two complete sets Ak∗A_{k^*}Ak∗​ and Ak∗+1A_{k^*+1}Ak∗+1​ dominates any incomplete set.

Formalization Note The paper states Proposition 6 as "the only nondominated sets are the complete sets AkA_kAk​, k=1,…,nk = 1, \dots, nk=1,…,n. Moreover, the optimal policy is a nested allocation policy where the nesting is by fare order." This item states what the proof (pp. 24–25) establishes, the two conditions of Theorem 2 / Definition 4. The literal first sentence is false when fares tie: with r1=r2>0r_1 = r_2 > 0r1​=r2​>0 and w1=w2w_1 = w_2w1​=w2​, the incomplete set {2}\{2\}{2} is nondominated; it is stated separately as proposition_6_nondominated_complete under strictly decreasing fares. The "Moreover" sentence about nested allocation policies (Definition 3) is not formalized. The empty set A0A_0A0​ counts as complete; without it, condition 2 fails whenever all xj<0x_j < 0xj​<0.


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_RevenueManagement_singleResource
import Definitions.Def_ChoiceRM_MNL_FareOrder
import Definitions.Def_ChoiceRM_MNL_Models
Formal statement
namespace ChoiceRM.MNL

/-- Proposition 6, p. 23, in the form its proof establishes (pp. 24–25): the MNL choice model (14)
with positive weights has the nesting-by-fare-order property of Definition 4. -/
theorem proposition_6 {n : ℕ} (w : Fin n → ℝ) (hw : ∀ j, 0 < w j) :
    HasFareOrderNesting (mnl w) := by sorry

end ChoiceRM.MNL
Source
Talluri, van Ryzin, Revenue management under a general discrete choice model of consumer behavior, working paper of October 21, 2001 (UPF Economics Working Paper 533; published Management Science 50(1), 2004, DOI 10.1287/mnsc.1030.0147), p. 23, Proposition 6 (proof pp. 24–25)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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