Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
From MaRDI portal
Publication:3116077
DOI10.1287/mnsc.1060.0613zbMath1232.91420MaRDI QIDQ3116077
Publication date: 21 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.1060.0613
68T05: Learning and adaptive systems in artificial intelligence
91B38: Production theory, theory of the firm
90C39: Dynamic programming
91B42: Consumer behavior, demand theory
Related Items
Unnamed Item, The Valuator’s Curse: Decision Analysis of Overvaluation and Disappointment in Acquisition, Unnamed Item, Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models, Customer Choice Models vs. Machine Learning: Finding Optimal Product Displays on Alibaba, Dynamic Programs with Shared Resources and Signals: Dynamic Fluid Policies and Asymptotic Optimality, Robust Learning of Consumer Preferences, Dynamic Learning and Decision Making via Basis Weight Vectors, Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards, Mass Customization and “Forecasting Options’ Penetration Rates Problem”, MNL-Bandit: A Dynamic Learning Approach to Assortment Selection, Nonstationary Bandits with Habituation and Recovery Dynamics, Learning in Combinatorial Optimization: What and How to Explore, An Approximation Approach for Response-Adaptive Clinical Trial Design, An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits, Per-Round Knapsack-Constrained Linear Submodular Bandits, Response-adaptive designs for clinical trials: simultaneous learning from multiple patients, Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic, Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation, A branch-and-cut algorithm for the latent-class logit assortment problem, Managing limited retail space for basic products: space sharing vs. space dedication, Assortment optimization over time, A revised approach for risk-averse multi-armed bandits under CVaR criterion, Combinatorial assortment optimization, Optimal policies for the pricing and replenishment of fashion apparel considering the effect of fashion level, Optimal online markdown and markup pricing policies with demand uncertainty, Dynamic pricing and inventory control: robust vs. stochastic uncertainty models---a computational study, Pricing to accelerate demand learning in dynamic assortment planning for perishable products, Optimal learning with non-Gaussian rewards, Dynamic Assortment Personalization in High Dimensions, INDEXABILITY OF BANDIT PROBLEMS WITH RESPONSE DELAYS
