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
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: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
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:2301.12254v5 Announce Type: replace-cross
Abstract: Assortment optimization has received active explorations in the past few decades due to its practical importance. Despite the extensive liter...
By Shuting Shen, Xi Chen, Ethan X. Fang, Junwei Lu
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