Fetching the paper…
Reading the bibliography…
In this paper, we study the dynamic assortment optimization problem under a finite selling season of length $T$.
Conditional logit analysis of qualitative choice behaviour
McFadden, D. (1973) · 1973
Earlier work this paper cites.
On tail probabilities for martingales
Freedman, D. A. (1975) · 1975
Earlier work this paper cites.
Least squares quantization in pcm
Lloyd, S. (1982) · 1982
Earlier work this paper cites.
Empirical Processes in M-Estimation
van de Geer, S. A. (2000) · 2000
Earlier work this paper cites.
Asymptotic statistics
Van der Vaart, A. W. (2000) · 2000
Earlier work this paper cites.
Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
Caro, F., & Gallien, J. (2007) · 2007
Earlier work this paper cites.
Stochastic Linear Optimization under Bandit Feedback
Dani, V., Hayes, T. P., & Kakade, S. M. (2008) · 2008
Earlier work this paper cites.
Introduction to nonparametric estimation
Tsybakov, A. B. (2009) · 2009
Earlier work this paper cites.
Parametric bandits: The generalized linear case
Filippi, S., Cappe, O., Garivier, A., & Szepesvári, C. (2010) · 2010
Earlier work this paper cites.
Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
Rusmevichientong, P., Shen, Z.-J., & Shmoys, D. (2010) · 2010
Cited alongside, same era.
Linearly parameterized bandits
Rusmevichientong, P., & Tsitsiklis, J. N. (2010) · 2010
Cited alongside, same era.
Improved algorithms for linear stochastic bandits
Abbasi-Yadkori, Y., Pál, D., & Szepesvári, C. (2011) · 2011
Cited alongside, same era.
Contextual bandits with linear payoff functions
Chu, W., Li, L., Reyzin, L., & Schapire, R. (2011) · 2011
Cited alongside, same era.
How close is the sample covariance matrix to the actual covariance matrix?
Vershynin, R. (2012) · 2012
Cited alongside, same era.
Thompson sampling for contextual bandits with linear payoffs
Agrawal, S., & Goyal, N. (2013) · 2013
Cited alongside, same era.
A statistical learning approach to personalization in revenue management
Chen, X., Owen, Z., Pixton, C., & Simchi-Levi, D. (2015) · 2015
Later among the works it cites.
Exponential inequalities for martingales with applications
Fan, X., Grama, I., & Liu, Q. (2015) · 2015
Later among the works it cites.
Dynamic recommendation at checkout under inventory constraint
Chen, X., Ma, W., Simchi-Levi, D., & Xin, L. (2016) · 2016
Later among the works it cites.
Thompson sampling for online personalized assortment optimization problems with multinomial logit choice models
Cheung, W. C., & Simchi-Levi, D. (2017) · 2017
Later among the works it cites.
Provably optimal algorithms for generalized linear contextual bandits
Li, L., Lu, Y., & Zhou, D. (2017) · 2017
Later among the works it cites.
A note on tight lower bound for mnl-bandit assortment selection models
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Optimal dynamic assortment planning with demand learning
Saure, D., & Zeevi, A. (2013) · 2013
Cited alongside, same era.
Real-time optimization of personalized assortments
Golrezaei, N., Nazerzadeh, H., & Rusmevichientong, P. (2014) · 2014
Cited alongside, same era.
MNL-bandit: A dynamic learning approach to assortment selection
Agrawal, S., Avadhanula, V., Goyal, V., & Zeevi, A. (2017a)
Cited in the paper.
Thompson sampling for MNL-bandit
Agrawal, S., Avandhanula, V., Goyal, V., & Zeevi, A. (2017b)
Cited in the paper.
Chen, X., & Wang, Y. (2018) · 2018
Closest in time.
Dynamic assortment selection under nested logit models
Chen, X., Wang, Y., & Zhou, Y. (2018) · 2018
Closest in time.
Near-optimal policies for dynamic multinomial logit assortment selection models
Wang, Y., Chen, X., & Zhou, Y. (2018) · 2018
Closest in time.