Pages that link to "Item:Q5129205"
From MaRDI portal
The following pages link to MNL-Bandit: A Dynamic Learning Approach to Assortment Selection (Q5129205):
Displayed 14 items.
- Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm (Q2091834) (← links)
- Dynamic Assortment Personalization in High Dimensions (Q3387950) (← links)
- Game of Thrones: Fully Distributed Learning for Multiplayer Bandits (Q4991671) (← links)
- Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models (Q5026455) (← links)
- A regret lower bound for assortment optimization under the capacitated MNL model with arbitrary revenue parameters (Q5051208) (← links)
- (Q5053221) (← links)
- Smoothness-Adaptive Contextual Bandits (Q5060496) (← links)
- Robust Learning of Consumer Preferences (Q5080653) (← links)
- Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information (Q5095163) (← links)
- (Q5149014) (← links)
- Stochastic approximation for uncapacitated assortment optimization under the multinomial logit model (Q6051595) (← links)
- Optimal pricing of online products based on customer anchoring‐adjustment psychology (Q6082285) (← links)
- A tractable online learning algorithm for the multinomial logit contextual bandit (Q6113379) (← links)
- Transfer learning for contextual multi-armed bandits (Q6192325) (← links)