Pages that link to "Item:Q3116077"
From MaRDI portal
The following pages link to Dynamic Assortment with Demand Learning for Seasonal Consumer Goods (Q3116077):
Displayed 34 items.
- Response-adaptive designs for clinical trials: simultaneous learning from multiple patients (Q320737) (← links)
- Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (Q333075) (← links)
- Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation (Q490352) (← links)
- A branch-and-cut algorithm for the latent-class logit assortment problem (Q496669) (← links)
- Managing limited retail space for basic products: space sharing vs. space dedication (Q1694815) (← links)
- Assortment optimization over time (Q1785447) (← links)
- A revised approach for risk-averse multi-armed bandits under CVaR criterion (Q2060576) (← links)
- Combinatorial assortment optimization (Q2190396) (← links)
- Optimal policies for the pricing and replenishment of fashion apparel considering the effect of fashion level (Q2325213) (← links)
- Optimal online markdown and markup pricing policies with demand uncertainty (Q2353645) (← links)
- Dynamic pricing and inventory control: robust vs. stochastic uncertainty models---a computational study (Q2430595) (← links)
- Pricing to accelerate demand learning in dynamic assortment planning for perishable products (Q2514887) (← links)
- Optimal learning with non-Gaussian rewards (Q2806349) (← links)
- Dynamic Assortment Personalization in High Dimensions (Q3387950) (← links)
- INDEXABILITY OF BANDIT PROBLEMS WITH RESPONSE DELAYS (Q3585147) (← links)
- The Valuator’s Curse: Decision Analysis of Overvaluation and Disappointment in Acquisition (Q4991768) (← links)
- (Q4998871) (← links)
- Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models (Q5026455) (← links)
- Customer Choice Models vs. Machine Learning: Finding Optimal Product Displays on Alibaba (Q5031014) (← links)
- Dynamic Programs with Shared Resources and Signals: Dynamic Fluid Policies and Asymptotic Optimality (Q5058058) (← links)
- Robust Learning of Consumer Preferences (Q5080653) (← links)
- Dynamic Learning and Decision Making via Basis Weight Vectors (Q5095179) (← links)
- Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards (Q5113912) (← links)
- Mass Customization and “Forecasting Options’ Penetration Rates Problem” (Q5129183) (← links)
- MNL-Bandit: A Dynamic Learning Approach to Assortment Selection (Q5129205) (← links)
- Nonstationary Bandits with Habituation and Recovery Dynamics (Q5144777) (← links)
- Learning in Combinatorial Optimization: What and How to Explore (Q5144784) (← links)
- An Approximation Approach for Response-Adaptive Clinical Trial Design (Q5148171) (← links)
- (Q5149014) (← links)
- An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits (Q5203955) (← links)
- Per-Round Knapsack-Constrained Linear Submodular Bandits (Q5380603) (← links)
- Optimal and heuristic policies for production and inventory controls in dual supply chains with fluctuating demands (Q6057033) (← links)
- Operations strategies with snobbish and strategic consumers (Q6076472) (← links)
- Multi-plant manufacturing assortment planning in the presence of transshipments (Q6113449) (← links)