The choice model of Theorem 4.6 is regular
ProvedRevenueOrdered.UDPmin.reduction_isRegularassortment-optimizationdiscrete-choicep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reduction
For every instance with at least one consumer, the choice model on , where spreads probability uniformly over the set of cheapest acceptable copies of consumer 's items, is a regular discrete choice model: it satisfies axioms (i)–(iv), including
This is the part of Theorem 4.6 that places inside the scope of the paper's guarantees for regular models.
Preamble
import Mathlib import Definitions.Def_RevenueOrdered_UDPmin_Model import Definitions.Def_RevenueOrdered_UDPmin_Pricing import Definitions.Def_RevenueOrdered_UDPmin_Reduction
Formal statement
namespace RevenueOrdered.UDPmin
/-- The choice model of Theorem 4.6 is regular (Berbeglia–Joret, arXiv:1606.01371v3, §4.5.1,
proof of Theorem 4.6, pp. 17–18). -/
theorem reduction_isRegular {X M : Type*} [Fintype X] [DecidableEq X] [Fintype M] [Nonempty M]
(I : Instance X M) :
IsRegular (redP I) := by sorry
end RevenueOrdered.UDPmin
Source
Berbeglia & Joret, Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments, arXiv:1606.01371v3, §4.5.1, proof of Theorem 4.6, pp. 17–18
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.