Robust Dynamic Assortment Optimization in the Presence of Outlier Customers

10/09/2019
by   Xi Chen, et al.
0

We consider the dynamic assortment optimization problem under the multinomial logit model (MNL) with unknown utility parameters. The main question investigated in this paper is model mis-specification under the ε-contamination model, which is a fundamental model in robust statistics and machine learning. In particular, throughout a selling horizon of length T, we assume that customers make purchases according to a well specified underlying multinomial logit choice model in a (1-ε)-fraction of the time periods, and make arbitrary purchasing decisions instead in the remaining ε-fraction of the time periods. In this model, we develop a new robust online assortment optimization policy via an active elimination strategy. We establish both upper and lower bounds on the regret, and show that our policy is optimal up to logarithmic factor in T when the assortment capacity is constant. Furthermore, we develop a fully adaptive policy that does not require any prior knowledge of the contamination parameter ε. Our simulation study shows that our policy outperforms the existing policies based on upper confidence bounds (UCB) and Thompson sampling.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2018

Dynamic Assortment Optimization with Changing Contextual Information

In this paper, we study the dynamic assortment optimization problem unde...
research
04/13/2018

Fast, Parameter free Outlier Identification for Robust PCA

Robust PCA, the problem of PCA in the presence of outliers has been exte...
research
06/27/2018

Dynamic Assortment Selection under the Nested Logit Models

We study a stylized dynamic assortment planning problem during a selling...
research
11/18/2020

On Uninformative Optimal Policies in Adaptive LQR with Unknown B-Matrix

This paper presents local asymptotic minimax regret lower bounds for ada...
research
05/10/2023

Constant Approximation for Network Revenue Management with Markovian-Correlated Customer Arrivals

The Network Revenue Management (NRM) problem is a well-known challenge i...
research
09/28/2022

Near-Optimal Adaptive Policies for Serving Stochastically Departing Customers

We consider a multi-stage stochastic optimization problem originally int...
research
02/07/2019

Cost-Effective Incentive Allocation via Structured Counterfactual Inference

We address a practical problem ubiquitous in modern industry, in which a...

Please sign up or login with your details

Forgot password? Click here to reset