The paper introduces a robust framework for assortment optimization that addresses distributional shifts in customer choice behavior. It demonstrates computational tractability when the nominal choice model is known and develops statistically optimal algorithms for the data‑driven setting, providing matching upper and lower bounds on sample complexity. The authors identify "robust item‑wise coverage" as the minimal data requirement for efficient robust learning, bridging robustness and statistical efficiency in assortment planning.
By Miao Lu, Yuxuan Han, Han Zhong, Zhengyuan Zhou, Jose Blanchet
arXiv:2608. 11419v1 Announce Type: new Abstract: Assortment optimization is a fundamental problem in revenue management, typically addressed using parametric choice models such as the multinomial logit (MNL) and its variants.
By Junyi Liao, Xiaohui Jiang, Zhengwei Tong, Ethan X. Fang, Vahid Tarokh
arXiv:2606. 11118v1 Announce Type: new Abstract: We study a dynamic assortment problem on a two-sided service platform with incomplete information and heterogeneous customers in a discrete-time setting.
By Rahul Roy, Nur Sunar, Jayashankar M. Swaminathan
arXiv:2209. 04942v2 Announce Type: replace-cross Abstract: Problem definition: This paper studies the problem of estimating consumer preferences from bundle sales data.
By Ningyuan Chen, Setareh Farajollahzadeh, Qingwei Jin, Fanni Shen, Guan Wang
arXiv:2607. 09817v1 Announce Type: new Abstract: We propose a framework for the Markov chain (MC) choice model with panel data, including parameter estimation, personalized choice prediction, and personalized assortment optimization.
By Yalcin Akcay, Gerardo Berbeglia, Young-San Lin
arXiv:2402. 06158v2 Announce Type: replace-cross Abstract: In the rapidly evolving landscape of retail, assortment planning plays a crucial role in determining the success of a business.
By Shaojie Tang, Shuzhang Cai, Jing Yuan, Kai Han
arXiv:2608. 12680v1 Announce Type: cross Abstract: Item demand forecasting is an integral component of store assortment optimization.
By Lakshya Garg, Deep Narayan Mishra, Swapnil Yadav, Haoan Wang, Sujal Alugubelli, Karthik Kumaran, Anupriya Sharma
The paper presents a computationally efficient optimal design framework for multinomial logit (MNL) bandits, addressing the combinatorial action space that makes traditional methods infeasible. It introduces two approaches: an exact or certified-approximate mixed-integer linear program with solver‑certified early stopping, and a fully polynomial‑time lifted design using a tractable surrogate objective. Leveraging the Kiefer‑Wolfowitz equivalence theorem, the authors provide near G‑optimality guarantees and apply the framework to develop a best assortment identification algorithm with an instance‑dependent sample complexity of τO((d log N)/Δ²).
By Joongkyu Lee, Min-hwan Oh
arXiv:2607. 11684v1 Announce Type: cross Abstract: Existing contextual multinomial logit (MNL) bandits model relevance-driven choice but ignore the potential benefits of within-assortment diversity, while submodular/combinatorial bandits encode diversity in rewards but lack structured choice probabilities.
By Heesang Ann, Taehyun Hwang, Min-hwan Oh
arXiv:2609.16952v1 Announce Type: cross
Abstract: Feature-based multi-product pricing uses customer characteristics to identify demand heterogeneity and tailor prices across products. Choice model tr...
By Jiajie Zhang, Yanqiu Ruan, Xiao Jin, Chung Piaw Teo
arXiv:2507. 10834v4 Announce Type: replace Abstract: Assortment optimization seeks to select a subset of substitutable products, subject to constraints, to maximize expected revenue.
By Guokai Li, Pin Gao, Stefanus Jasin, Zizhuo Wang
The paper introduces SAUSS, a stochastic approximation method that uses conditionally unbiased mini‑batch score estimates for multinomial choice models. By employing a fixed mini‑batch size and exact conditional sampling, SAUSS reduces simulation bias and computational cost compared to simulated maximum likelihood. The authors provide asymptotic theory, simulation results, and an application demonstrating comparable accuracy in far less time.
By Sokbae Lee, Yuan Liao, Myung Hwan Seo, Youngki Shin