A tractable online learning algorithm for the multinomial logit contextual bandit

•This work considers the dynamic assortment optimization problem.•The consumer choice is modelled via Multinomial logit contextual model.•The worst-case regret bound is free from the multiplicative problem dependent factor k and improves upon the previous bounds in the literature.•The k factor could...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 310; no. 2; pp. 737 - 750
Main Authors:	Agrawal, Priyank, Tulabandhula, Theja, Avadhanula, Vashist
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.10.2023
Subjects:	Multi-armed bandit Multinomial logit model OR in marketing Revenue management Sequential decision-making OR in marketing Revenue management Sequential decision-making Multi-armed bandit Multinomial logit model
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!