Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
Published Online:1 Feb 2007https://doi.org/10.1287/mnsc.1060.0613
References
- Relaxations of weakly coupled stochastic dynamic programs. (2004) . Working paper, Graduate School of Business, The University of Chicago, Chicago, ILGoogle Scholar
- Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost. IEEE Trans. Automatic Control (1988) 33(10):899–906Crossref, Google Scholar
- Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays—Part I: I.i.d. rewards. IEEE Trans. Automatic Control (1987) 32(11):968–976Crossref, Google Scholar
- Pricing of short life-cycle products through active learning. (2002) . Working paper, Washington University, St. Louis, MOGoogle Scholar
- Discrete Choice Analysis (1985) (MIT Press, Cambridge, MA) Google Scholar
- Bandit Problems, Sequential Allocation of Experiments (1985) (Chapman and Hall, New York) Crossref, Google Scholar
- Nonlinear Programming (1999) (Athena Scientific, Belmont, MA) Google Scholar
- Dynamic Programming and Optimal Control (2001) I and II(Athena Scientific, Belmont, MA) Google Scholar
- A learning approach to customized marketing. (2004) . Working paper, The University of Chicago, Chicago, ILGoogle Scholar
- Optimal learning and experimentation in bandit problems. J. Econom. Dynam. Control (2002) 27:87–108Crossref, Google Scholar
- SHARP: Shelf allocation for retailers profit. Marketing Sci. (1988) 7:211–231Link, Google Scholar
- Dynamic retail assortment models with demand learning for seasonal consumer goods. (2005) . Ph.D. thesis, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
- Approximate dynamic programming for sensor management. Proc. 36th IEEE Conf. Decision and Control (1997) San Diego, CA:1202–1207Crossref, Google Scholar
- Optimal Statistical Decisions (1970) (McGraw-Hill, New York) Google Scholar
- Reducing the cost of demand uncertainty through accurate response to early sales. Oper. Res. (1996) 44(1):87–99Link, Google Scholar
- Rocket science retailing is almost here—Are you ready. Harvard Bus. Rev. (2000) July–August):115–124Google Scholar
- ZARA: Fast fashion. (2003) . Harvard Business School Multimedia Case 9-703-416, Harvard University, Boston, MAGoogle Scholar
- Response surface bandits. J. Roy. Statist. Soc. Series B (1995) 57:771–784Google Scholar
- Bandit processes and dynamic allocation indices. J. Roy. Statist. Soc. Series B (1979) 14:148–167Google Scholar
- New adaptive designs for delayed response models. J. Sequential Planning Inference (2006) 136:1940–1955Crossref, Google Scholar
- A Lagrangian decomposition approach to weakly coupled dynamic optimization problems and its applications. (2003) . Ph.D. thesis, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
- The multilocation multiperiod inventory problem: Bounds and approximations. Management Sci. (1987) 33(1):86–94Link, Google Scholar
- Demand estimation and assortment optimization under substitution: Methodology and application. (2004) . Working paper, Duke University, Durham, NCGoogle Scholar
- Convergence properties of the Nelder-Mead simplex method in low dimensions. SIAM J. Optim. (1998) 9(1):112–147Crossref, Google Scholar
- Stocking retail assortments under dynamic consumer substitution. Oper. Res. (2001) 49:334–351Link, Google Scholar
- Sequential Control with Incomplete Information: The Bayesian Approach to Multi-Armed Bandit Problems (1990) (Academic Press, San Diego, CA) Google Scholar
- Management of multi-item retail inventory systems with demand substitution. Oper. Res. (2000) 48:50–64Link, Google Scholar
- On the relationship between inventory costs and variety benefits in retail assortments. Management Sci. (1999) 45:1496–1509Link, Google Scholar
- On an index policy for restless bandits. J. Appl. Probab. (1990) 27:637–648Crossref, Google Scholar
- , Gani J. Restless bandits: Activity allocation in a changing world. A Celebration of Applied Probability. J. Appl. Probab. (1988) 25A:287–298Crossref, Google Scholar

