2023
DOI: 10.48550/arxiv.2303.02504
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

MNL-Bandit in non-stationary environments

Abstract: In this paper, we study the MNL-Bandit problem in a non-stationary environment and present an algorithm with worst-case dynamic regret of Õ min √ N T L , N

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 14 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?