scientific article; zbMATH DE number 7306904
From MaRDI portal
Publication:5149014
Yuan Zhou, Yining Wang, Xi Chen
Publication date: 5 February 2021
Full work available at URL: https://arxiv.org/abs/1810.13069
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
upper confidence boundscontextual informationregret analysisbandit learningdynamic assortment optimization
Related Items (2)
A tractable online learning algorithm for the multinomial logit contextual bandit ⋮ Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models
Cites Work
- Unnamed Item
- On tail probabilities for martingales
- A note on a tight lower bound for capacitated MNL-bandit assortment selection models
- Exponential inequalities for martingales with applications
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
- Linearly Parameterized Bandits
- Asymptotic Statistics
- Least squares quantization in PCM
- MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
- Introduction to nonparametric estimation
This page was built for publication:
