Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.19008

Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing

Yunfan Zhang·Yuxuan Han·Hongyu Shan·Jose Blanchet·Zhengyuan Zhou
View original source ↗Read source document ↗Export metadata ↓

Abstract

Selecting which products to display and at what prices is a central decision in retail and e-commerce operations. In many applications, these two choices must be made jointly under limited display capacity and uncertain customer demand. In this paper, we study the joint assortment and pricing problem under a price-based contextual multinomial logit model, where customer preferences depend on both product features and selling prices. Our analysis begins with the construction of a new confidence region for demand estimation under price-dependent features. Building on this result, we develop a pessimistic offline algorithm and SupCB-type online algorithms for joint assortment and pricing optimization. In the offline setting, we establish a suboptimality guarantee governed by local information around the optimal assortment-price pair, rather than by exact coverage of the optimal action. In the online setting, our SupCB-type algorithm improves the best previously known regret bound to $\widetilde{O}(W\sqrt{dT\log N}/L_0)$, and we also provide a computationally simpler Thompson-sampling alternative. When specialized to the assortment-only or pricing-only setting, our bounds recover the near-minimax-optimal rates established in those respective domains, thereby bridging the gap between the mature study on assortment optimization or dynamic pricing and the limited literature on their joint optimization.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yunfan Zhang, Yuxuan Han, Hongyu Shan, Jose Blanchet, Zhengyuan Zhou. 2026-04-21. Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing. https://arxiv.org/abs/2604.19008

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs

We address the behavior of idealized deep residual neural networks (ResNets), modeled via an optimal control problem set over continuity (or adjoint transport) equations. The continuity equations describe the statistical evolution of the features in the asymptotic regime where the layers of the network form a continuum. The velocity field is expressed through the network activation function, which is itself viewed as a function of the statistical distribution of the network parameters (weights and biases). From a mathematical standpoint, the control is interpreted in a relaxed sense, taking values in the space of probability measures over the set of parameters. We investigate the optimal behavior of the network when the cost functional arises from a regression problem and includes an additional entropic regularization term on the distribution of the parameters. In this framework, we focus in particular on the existence of stable optimizers --that is, optimizers at which the Hessian of the cost is non-degenerate. We show that, for an open and dense set of initial data, understood here as probability distributions over features and associated labels, there exists a unique stable global minimizer of the control problem. Moreover, we show that such minimizers satisfy a local Polyak--Lojasiewicz inequality, which can lead to exponential convergence of the corresponding gradient descent when the initialization lies sufficiently close to the optimal parameters. This result thus demonstrates the genericity (with respect to the distribution of features and labels) of the Polyak--Lojasiewicz condition in ResNets with a continuum of layers and under entropic penalization.

math.OC↗
arXiv2026

A regret minimization approach to fixed-point iterations

We propose a conversion scheme that turns regret minimizing algorithms into fixed point iterations, with convergence guarantees following from regret bounds. The resulting iterations can be seen as a grand extension of the classical Krasnoselskii--Mann iterations, as the latter are recovered by converting the Online Gradient Descent algorithm. This approach yields new simple iterations for finding fixed points of non-self operators. We also focus on converting algorithms from the AdaGrad family of regret minimizers, and thus obtain fixed point iterations with adaptive guarantees of a new kind. Numerical experiments on various problems demonstrate faster convergence of AdaGrad-based fixed point iterations over Krasnoselskii--Mann iterations.

math.OC↗
arXiv2026

Variational Analysis in Spectral Decomposition Systems

This work is concerned with the variational analysis of functions defined on Euclidean spaces whose values depend solely on certain invariants (``spectrum'') of their arguments, a class we term ``spectral functions.'' Building on our previous work \cite{PartI} on the convex analysis of such functions, we work in the abstract framework of spectral decomposition systems, which covers a wide range of previously studied settings, including eigenvalue decomposition of Hermitian matrices and singular value decomposition of rectangular matrices, and allows the derivation of new results in more general settings such as normal decomposition systems. The main results of this work provide constructive formulae for computing the regular, limiting, and Clarke subdifferentials of a spectral function in terms of the corresponding objects of the associated invariant function. Finally, we obtain a generalization of Lidski\uı's theorem on the spectrum of additive perturbations of Hermitian matrices to arbitrary spectral decomposition systems.

math.OC↗