CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Dynamic Assortment Optimization with Changing Contextual Information
Authors
Xi Chen
Yining Wang
Yuan Zhou
Publication date
17 January 2019
Publisher
View
on
arXiv
Abstract
In this paper, we study the dynamic assortment optimization problem under a finite selling season of length
T
T
T
. At each time period, the seller offers an arriving customer an assortment of substitutable products under a cardinality constraint, and the customer makes the purchase among offered products according to a discrete choice model. Most existing work associates each product with a real-valued fixed mean utility and assumes a multinomial logit choice (MNL) model. In many practical applications, feature/contexutal information of products is readily available. In this paper, we incorporate the feature information by assuming a linear relationship between the mean utility and the feature. In addition, we allow the feature information of products to change over time so that the underlying choice model can also be non-stationary. To solve the dynamic assortment optimization under this changing contextual MNL model, we need to simultaneously learn the underlying unknown coefficient and makes the decision on the assortment. To this end, we develop an upper confidence bound (UCB) based policy and establish the regret bound on the order of
O
~
(
d
T
)
\widetilde O(d\sqrt{T})
O
(
d
T
​
)
, where
d
d
d
is the dimension of the feature and
O
~
\widetilde O
O
suppresses logarithmic dependence. We further established the lower bound
Ω
(
d
T
/
K
)
\Omega(d\sqrt{T}/K)
Ω
(
d
T
​
/
K
)
where
K
K
K
is the cardinality constraint of an offered assortment, which is usually small. When
K
K
K
is a constant, our policy is optimal up to logarithmic factors. In the exploitation phase of the UCB algorithm, we need to solve a combinatorial optimization for assortment optimization based on the learned information. We further develop an approximation algorithm and an efficient greedy heuristic. The effectiveness of the proposed policy is further demonstrated by our numerical studies.Comment: 4 pages, 4 figures. Minor revision and polishing of presentatio
Similar works
Full text
Available Versions
IUScholarWorks Open
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:iu.tind.io:1364
Last time updated on 18/04/2020