arXiv Machine Learning By Rahul Roy, Nur Sunar, Jayashankar M. Swaminathan

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

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

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