MNL-bandit: a dynamic learning approach to assortment selection (Q5129205)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7266019
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | MNL-bandit: a dynamic learning approach to assortment selection |
scientific article; zbMATH DE number 7266019 |
Statements
MNL-Bandit: A Dynamic Learning Approach to Assortment Selection (English)
0 references
26 October 2020
0 references
exploration-exploitation
0 references
assortment optimization
0 references
upper confidence bound
0 references
multinomial logit
0 references
0 references
0 references
0 references
0.8762229681015015
0 references
0.8237152099609375
0 references
0.8144327402114868
0 references
0.7947791218757629
0 references
0.7933111190795898
0 references
