A note on a tight lower bound for capacitated MNL-bandit assortment selection models
Year of publication: |
September 2018
|
---|---|
Authors: | Chen, Xi ; Wang, Yining |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 46.2018, 5, p. 534-537
|
Subject: | Dynamic assortment selection | Multinomial logit choice model | Regret minimization | Information-theoretical lower bound | Theorie | Theory | Logit-Modell | Logit model | Mathematische Optimierung | Mathematical programming | Diskrete Entscheidung | Discrete choice |
-
Optimal policy for dynamic assortment planning under multinomial logit models
Chen, Xi, (2021)
-
Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
Aouad, Ali, (2018)
-
Robust assortment optimization under sequential product unavailability
Mehrani, Saharnaz, (2022)
- More ...
-
Dynamic Assortment Planning Under Nested Logit Models
Chen, Xi, (2020)
-
Uncertainty Quantification for Demand Prediction in Contextual Dynamic Pricing
Wang, Yining, (2021)
-
Dynamic Assortment Planning Without Utility Parameter Estimation
Chen, Xi, (2018)
- More ...