Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
By Felipe Caro, Jérémie Gallien. Management Sciences, 2007
306 citations recorded by the source corpus.
Subfields: Management Information Systems, Management Science and Operations Research, Marketing
View Paper: https://www.semanticscholar.org/paper/c15d734cf0402f7fa80acd063f67d69fd6148bf7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Management Information Systems
- Assaf J. Zeevi
- Paat Rusmevichientong
- David B. Shmoys
- Zuo-Jun Max Shen
- Aleksandrs Slivkins
- Ming Chen
- Zhi-Long Chen
- Vivek F. Farias
In Management Science and Operations Research
- Assaf J. Zeevi
- Yang Yuan
- Pradheep Elango
- Paat Rusmevichientong
- David B. Shmoys
- Zuo-Jun Max Shen
- Yajun Wang
- Omar Besbes
In Marketing
- Paat Rusmevichientong
- David B. Shmoys
- Zuo-Jun Max Shen
- Deepak K. Agarwal
- Bee-Chung Chen
- Vivek F. Farias
- Devavrat Shah
- Srikanth Jagabathula
Citations in the corpus
- Explore/Exploit Schemes for Web Content Optimization (2009, background): “By now, multi-armed bandit schemes have found wide applicability in diverse areas like clinical trials [4], marketing [5], management [6], web search [7] and online advertising [8].”
- Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards (2014, background): “Since their inception, MAB problems with various modifications have been studied extensively in Statistics, Economics, Operations Research, and Computer Science, and are used to model a plethora of dynamic optimization problems under uncertainty; examples include clinical trials ([3]), strategic pri”
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint (2010, background): “different assortments, observing purchases, and estimating the demand model from past sales and assortment decisions (Caro and Gallien, 2007).”
- Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms (2014, background): “Other instances include the matching bandit (Gai et al., 2010) and the online shortest path problem (Liu & Zhao, 2012).”
- Dynamic Pricing and Learning: Historical Origins, Current Research, and New Directions (2013, unknown): “[321–323]), product launch and product exit optimization (e.”