MNL-Bandit: A Dynamic Learning Approach to Assortment Selection III: On Instances Separated by Δ(v) the UCB Policy Has Regret at Most B₁N² log T/Δ(v) + B₂Research Paper
A retailer with limited shelf or screen space must choose which subset of its products to show each arriving customer. Which assortment earns the most depends on customer preferences, and those are unknown at first: the seller learns them from the purchases it observes. This is dynamic assortment selection, and it is a standard model in online retail and…