A Note on Tight Lower Bound for MNL-Bandit Assortment Selection Models

09/18/2017
by   Xi Chen, et al.
0

In this note we prove a tight lower bound for the MNL-bandit assortment selection model that matches the upper bound given in (Agrawal et al., 2016a,b) for all parameters, up to logarithmic factors.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset