Approximation Algorithms for Dynamic Assortment Optimization Models
نویسندگان
چکیده
منابع مشابه
Near-Optimal Algorithms for Capacity Constrained Assortment Optimization
Assortment optimization is an important problem that arises in many practical applications such as retailing and online advertising. In an assortment optimization problem, the goal is to select a subset of items that maximizes the expected revenue in the presence of the substitution behavior of consumers specified by a choice model. In this paper, we consider the capacity constrained version of...
متن کاملApproximation Algorithms for Combinatorial Optimization
In combinatorial optimization, the most important challenges are presented by problems belonging to the class NP-hard. For such problems no algorithm is known that can solve all instances in polynomial time. It is also strongly believed that no polynomial algorithm is capable of doing this. Although it is very difficult to solve exactly any of the NP-hard problems, some of them are amenable to ...
متن کاملPartially-ranked Choice Models for Data-driven Assortment Optimization
The assortment of products carried by a store has a crucial impact on its success. However, finding the right mix of products to attract a large portion of the customers is a challenging task. Several mathematical models have been proposed to optimize assortments. In particular, rank-based choice models have been acknowledged for representing well high-dimensional product substitution effects, ...
متن کاملSet Covering and Network Optimization: Dynamic and Approximation Algorithms
In this short note we summarize our results on development and analysis of approximation and dynamic algorithms for set covering and network optimization problems. The results include probabilistic analysis of set covering algorithms, development and analysis of dynamic algorithms for graph optimization problems, game-theoretic analysis of a file-sharing network model, and approximation algorit...
متن کاملAssortment Optimization for Choosy Customers
We study two different choice models that capture the purchasing behavior of customers who only consider purchasing one of two substitutable products. We refer to these customers as choosy. The first choice model captures substitution behavior through probabilistic transitions between products. Under this choice model, a customer’s buying process can be captured in two steps: an arrival with th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2019
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2018.0933