arXiv Machine Learning

Data-Driven Dynamic Assortment in Online Platforms: Learning about Two Sides

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.

arXiv Machine Learning
Aug 13

Diffusion-Based Data-Driven Assortment Optimization

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 Machine Learning
Aug 18

Learning to Price with Persuasion

arXiv:2608. 16699v1 Announce Type: cross Abstract: Motivated by modern marketplaces, where the platform or the seller routinely gathers detailed user profiles, we study a novel learning theoretic model that simultaneously involves information and mechanism design.

By Maria-Florina Balcan, Tejas Pagare, Karan Singh
arXiv Machine Learning
Aug 31

Robust Assortment Optimization from Observational Data

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 AI
Jun 30

Assortment Planning with Sponsored Products

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 Machine Learning
Jul 14

Diversified Multinomial Logit Contextual Bandits

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