Co-occurring keywords · papers mentioning both
Papers
Finally Rank-Breaking Conquers MNL Bandits: Optimal and Efficient Algorithms for MNL Assortment
ICLR 2025
Online Assortment and Price Optimization Under Contextual Choice Models
AISTATS 2025
Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
NeurIPS 2024
Online Learning of Delayed Choices
NeurIPS 2024
PASTA: Pessimistic Assortment Optimization
ICML 2023
Submodular Order Functions and Assortment Optimization
ICML 2023
Dynamic pricing and assortment under a contextual MNL demand
NeurIPS 2022
Adversarial Combinatorial Bandits with General Non-linear Reward Functions
ICML 2021
Fully Gap-Dependent Bounds for Multinomial Logit Bandit
AISTATS 2021
Multinomial Logit Bandit with Low Switching Cost
ICML 2020
Thompson Sampling for Multinomial Logit Contextual Bandits
NeurIPS 2019
Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models
NeurIPS 2018
Assortment Optimization Under the Mallows model
NeurIPS 2016
A Data-Driven Approach to Modeling Choice
NeurIPS 2009