Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
From MaRDI portal
Publication:3116077
DOI10.1287/mnsc.1060.0613zbMath1232.91420OpenAlexW2124832196MaRDI 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
Learning and adaptive systems in artificial intelligence (68T05) Production theory, theory of the firm (91B38) Dynamic programming (90C39) Consumer behavior, demand theory (91B42)
Related Items (34)
Dynamic Programs with Shared Resources and Signals: Dynamic Fluid Policies and Asymptotic Optimality ⋮ 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 ⋮ Robust Learning of Consumer Preferences ⋮ Dynamic Learning and Decision Making via Basis Weight Vectors ⋮ Optimal and heuristic policies for production and inventory controls in dual supply chains with fluctuating demands ⋮ Operations strategies with snobbish and strategic consumers ⋮ Combinatorial assortment optimization ⋮ Multi-plant manufacturing assortment planning in the presence of transshipments ⋮ Unnamed Item ⋮ Managing limited retail space for basic products: space sharing vs. space dedication ⋮ Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards ⋮ Dynamic pricing and inventory control: robust vs. stochastic uncertainty models---a computational study ⋮ Mass Customization and “Forecasting Options’ Penetration Rates Problem” ⋮ MNL-Bandit: A Dynamic Learning Approach to Assortment Selection ⋮ Per-Round Knapsack-Constrained Linear Submodular Bandits ⋮ Nonstationary Bandits with Habituation and Recovery Dynamics ⋮ Learning in Combinatorial Optimization: What and How to Explore ⋮ Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation ⋮ An Approximation Approach for Response-Adaptive Clinical Trial Design ⋮ A branch-and-cut algorithm for the latent-class logit assortment problem ⋮ INDEXABILITY OF BANDIT PROBLEMS WITH RESPONSE DELAYS ⋮ Assortment optimization over time ⋮ An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits ⋮ Pricing to accelerate demand learning in dynamic assortment planning for perishable products ⋮ Optimal learning with non-Gaussian rewards ⋮ Dynamic Assortment Personalization in High Dimensions ⋮ A revised approach for risk-averse multi-armed bandits under CVaR criterion ⋮ The Valuator’s Curse: Decision Analysis of Overvaluation and Disappointment in Acquisition ⋮ Optimal policies for the pricing and replenishment of fashion apparel considering the effect of fashion level ⋮ Unnamed Item ⋮ Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models ⋮ Optimal online markdown and markup pricing policies with demand uncertainty ⋮ Customer Choice Models vs. Machine Learning: Finding Optimal Product Displays on Alibaba
This page was built for publication: Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
