In this paper, we consider a Markov chain choice model with single transition. In this model, customers arrive at each product with a certain probability. If the arrived product is unavailable, then the seller can recommend a subset of available products to the customer and the customer will purchase one of the recommended products or choose not to purchase with certain transition probabilities. The distinguishing features of the model are that the seller can control which products to recommend depending on the arrived product and that each customer either purchases a product or leaves the market after one transition.
We study the assortment optimization problem under this model. Particularly, we show that this problem is generally NP-Hard even if each product could only transit to at most two products. Despite the complexity of the problem, we provide polynomial time algorithms for several special cases, such as when the transition probabilities are homogeneous with respect to the starting point, or when each product can only transit to one other product. We also provide a tight performance bound for revenue-ordered assortments. In addition, we propose a compact mixed integer program formulation that can solve this problem of large size. Through extensive numerical experiments, we show that the proposed algorithms can solve the problem efficiently and the obtained assortments could significantly improve the revenue of the seller than under the Markov chain choice model.
Assortment optimization given basket shopping behavior using the Ising model
Imperial College Business School, Imperial College London(伦敦帝国理工学院商学院);Department of Statistical Science, University College London (UCL)(伦敦大学学院统计科学系);International Institute for Management Development (IMD)(国际管理发展学院)
A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
Stern School of Business, New York University(纽约大学斯特恩商学院);Department of Statistics and Operations Research, University of North Carolina(北卡罗来纳大学统计与运筹学系);Naveen Jindal School of Management, University of Texas at Dallas(德克萨斯大学达拉斯分校纳文·金达尔管理学院);Yau Mathematical Sciences Center & Department of Mathematical Sciences, Tsinghua University(清华大学丘成桐数学科学中心及数学科学系)
Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
Cornell Tech, Cornell University(康奈尔理工学院,康奈尔大学);Daniel J. Epstein Department of Industrial and Systems Engineering, University of Southern California(南加州大学丹尼尔·J·艾普斯坦工业与系统工程系)
Learning an Optimal Assortment Policy under Observational Data
Stern School of Business, New York University(纽约大学斯特恩商学院);Center for Data Science, Peking University(北京大学数据科学中心);Department of Management Science & Engineering, Stanford University(斯坦福大学管理科学与工程系)
Huge-Scale Assortment Optimization with Customer Choice: A Parallel Primal-Dual Approach
The Institute of Statistical Mathematics(统计数学研究所);The University of Tokyo(东京大学);Institute of Operations Research and Analytics, National University of Singapore(新加坡国立大学运筹与分析研究院);Department of Industrial Systems Engineering and Management, National University of Singapore(新加坡国立大学工业系统工程与管理系);ZOZO Next, Inc.(ZOZO Next公司)
Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing
Stern School of Business, New York University(纽约大学斯特恩商学院);China Europe International Business School (CEIBS)(中欧国际工商学院);Department of Management Science & Engineering, Stanford University(斯坦福大学管理科学与工程系)
Admission and Assortment Optimization for Multi-size Automated Parcel Lockers
Facultad de Ciencias Naturales y Matemáticas, Escuela Superior Politécnica del Litoral(自然科学与数学学院,厄瓜多尔高等理工学院);Department of Computing and Software, Faculty of Engineering, McMaster University(麦克马斯特大学工程学院计算与软件系);School of Industrial & Intelligent Systems Engineering, Faculty of Engineering, Tel Aviv University(特拉维夫大学工程学院工业与智能系统工程学院)
Do You Have My Size In Stock? Assortment and Inventory Optimization Under the Consider-Fit-Then-Choose Choice Model
School of Management, University College London(伦敦大学学院管理学院);Anderson School of Management, University of California, Los Angeles(加州大学洛杉矶分校安德森管理学院);Olin Business School, Washington University in St. Louis(华盛顿大学圣路易斯分校奥林商学院)