Optimal Dynamic Assortment Planning with Demand Learning

Authors:
Denis Sauré;Assaf Zeevi
Affiliations:
Swanson School of Engineering, University of Pittsburgh, Pittsburgh, Pennsylvania 15260;Graduate School of Business, Columbia University, New York, New York 10027
Venue:
Manufacturing & Service Operations Management
Year:
2013

Citing 15
Cited 0

Optimal dynamic pricing of inventories with stochastic demand over finite horizons

Management Science
On the Relationship Between Inventory Costs and Variety Benefits in Retailassortments

Management Science
Stocking Retail Assortments Under Dynamic Consumer Substitution

Operations Research
Assortment Planning and Inventory Decisions Under a Locational Choice Model

Management Science
Dynamic Assortment with Demand Learning for Seasonal Consumer Goods

Management Science
Relative Entropy, Exponential Utility, and Robust Dynamic Pricing

Operations Research
A Static Approximation for Dynamic Demand Substitution with Applications in a Competitive Market

Operations Research
Dynamic Pricing for Nonperishable Products with Demand Learning

Operations Research
Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms

Operations Research
Dynamic Pricing with a Prior on Market Response

Operations Research
Assortment Planning and Inventory Decisions Under Stockout-Based Substitution

Operations Research
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint

Operations Research
The Irrevocable Multiarmed Bandit Problem

Operations Research
Learning Consumer Tastes Through Dynamic Assortments

Operations Research
Dynamic Pricing Under a General Parametric Choice Model

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a family of stylized assortment planning problems, where arriving customers make purchase decisions among offered products based on maximizing their utility. Given limited display capacity and no a priori information on consumers' utility, the retailer must select which subset of products to offer. By offering different assortments and observing the resulting purchase behavior, the retailer learns about consumer preferences, but this experimentation should be balanced with the goal of maximizing revenues. We develop a family of dynamic policies that judiciously balance the aforementioned trade-off between exploration and exploitation, and prove that their performance cannot be improved upon in a precise mathematical sense. One salient feature of these policies is that they “quickly” recognize, and hence limit experimentation on, strictly suboptimal products.