Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information
From MaRDI portal
Publication:5095163
DOI10.1287/opre.2021.2235zbMath1494.90007arXiv1807.06497OpenAlexW4210936825MaRDI QIDQ5095163
Arnoud V. den Boer, Yannik Peeters, M. R. H. Mandjes
Publication date: 5 August 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.06497
Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial bandits
- Asymptotically efficient adaptive allocation rules
- Monopoly and product quality
- Applications of the van Trees inequality: A Bayesian Cramér-Rao bound
- A note on a tight lower bound for capacitated MNL-bandit assortment selection models
- Lipschitz Bandits without the Lipschitz Constant
- Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
- Assortment Planning and Inventory Decisions Under a Locational Choice Model
- Discrete Choice Methods with Simulation
- Revenue Management Under a General Discrete Choice Model of Consumer Behavior
- Inventory Competition Under Dynamic Consumer Choice
- The Nonstochastic Multiarmed Bandit Problem
- Sample mean based index policies by O(log n) regret for the multi-armed bandit problem
- Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems
- Optimal Policy for Dynamic Assortment Planning Under Multinomial Logit Models
- Dynamic Selling Mechanisms for Product Differentiation and Learning
- MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
- Improved Rates for the Stochastic Continuum-Armed Bandit Problem
- Some aspects of the sequential design of experiments
- A Stochastic Approximation Method
This page was built for publication: Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information
