EUVIMEDEUVIMED entdecken
Crossref

Exploration Optimization for Dynamic Assortment Personalization under Linear Preferences

Fernando G. Bernstein, Sajad Modaresi, Denis Saure

Operations Research · 16.11.2026

DOI: 10.1287/opre.2022.0205 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Operations Research, online erschienen am 16.11.2026. Verfasst von Fernando G. Bernstein und 2 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study dynamic assortment personalization, where an online retailer adaptively selects assortments based on customer attributes to learn preferences and maximize revenue. We assume that product utilities depend linearly on customer attributes through an unknown coefficient matrix, leading to an exploration–exploitation trade-off. We identify price-driven and linearity-driven exploration efficiencies, showing that not all products need to be offered to all customer profiles to recover optimal assortments. We establish an instance-dependent regret lower bound characterized by a linear program, which we call the Regret Lower Bound (RLB) problem. Because the RLB has a complex structure and depends non-trivially on unknown parameters, we introduce an alternative formulation, called the Exploration-Optimization problem, that yields an interpretable exploration structure and can be formulated as a tractable mixed-integer linear program. We develop learning policies that select efficient exploration sets by solving either problem and establish a regret upper bound for the Exploration-Optimization policy. Using data from a large Chilean retailer, we demonstrate that our policies substantially outperform Thompson sampling in terms of both regret and computational efficiency, while remaining scalable in practice.

Zitieren

APA

Bernstein, F. G., Modaresi, S., & Saure, D. (2026). Exploration Optimization for Dynamic Assortment Personalization under Linear Preferences. Operations Research. https://doi.org/10.1287/opre.2022.0205

Vancouver

Bernstein FG, Modaresi S, Saure D. Exploration Optimization for Dynamic Assortment Personalization under Linear Preferences. Operations Research. 2026. doi:10.1287/opre.2022.0205

BibTeX
@article{Bernstein2026,
  author = {Bernstein, Fernando G. and Modaresi, Sajad and Saure, Denis},
  title = {Exploration Optimization for Dynamic Assortment Personalization under Linear Preferences},
  journal = {Operations Research},
  year = {2026},
  doi = {10.1287/opre.2022.0205}
}
Kostenlos starten →