A Note on Tight Lower Bound for MNL-Bandit Assortment Selection Models.
Xi ChenYining WangPublished in: CoRR (2017)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- machine learning
- worst case
- model selection
- probabilistic model
- mathematical models
- branch and bound algorithm
- experimental data
- data sets
- objective function
- decision trees
- hidden markov models
- special case
- complex systems
- branch and bound
- information retrieval
- neural network