Pages that link to "Item:Q2294230"
From MaRDI portal
The following pages link to A note on a tight lower bound for capacitated MNL-bandit assortment selection models (Q2294230):
Displaying 7 items.
- 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)
- Robust Learning of Consumer Preferences (Q5080653) (← links)
- Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information (Q5095163) (← links)
- MNL-Bandit: A Dynamic Learning Approach to Assortment Selection (Q5129205) (← links)
- (Q5149014) (← links)
- Stochastic approximation for uncapacitated assortment optimization under the multinomial logit model (Q6051595) (← links)