1 November 2018 in Operations Research
Assortment optimization has received significant attention in recent revenue management and combinatorial optimization literature. In “The Approximability of Assortment Optimization Under Ranking Preferences,” A. Aouad, V. Farias, R. Levi, and D. Segev provide best-possible approximability bounds for this problem under an almost general model specification, where preferences are expressed as a distribution over rankings. This paper shows how this optimization problem relates to the computational task of detecting large independent sets in graphs, allowing the establishment of strong complexity lower bounds with respect to various problem parameters. These findings are complemented by a number of algorithms that attain essentially best-possible approximation factors, proving that the hardness results are tight up to lower-order terms. Surprisingly, their results imply that a simple and widely studied policy, known as revenue-ordered assortments, achieves the best possible performance guarantee with respect to prices.
1 February 2020 in Management Science
Assortment optimization is an important problem that arises in many practical applications such as retailing and online advertising. The fundamental goal is to select a subset of items to offer from a universe of substitutable items to maximize expected revenue when customers exhibit a random substitution behavior captured by a choice model. We study assortment optimization under the Markov chain choice model in the presence of capacity constraints that arise naturally in many applications. The Markov chain choice model considers item substitutions as transitions in a Markov chain and provides a good approximation for a large class of random utility models, thereby addressing the challenging problem of model selection in choice modeling. In this paper, we present constant factor approximation algorithms for the cardinality- and capacity-constrained assortment-optimization problem under the Markov chain model. We show that this problem is APX-hard even when all item prices are uniform, meaning that, unless P = NP, it is not possible to obtain an approximation better than a particular constant. Our algorithmic approach is based on a new externality adjustment paradigm that exactly captures the externality of adding an item to a given assortment on the remaining set of items, thereby allowing us to linearize a nonlinear, nonsubmodular, and nonmonotone revenue function and to design an iterative algorithm that iteratively builds up a provably good assortment. This paper was accepted by Yinyu Ye, optimization.
1 June 2021 in Management Science
We introduce a new optimization model, dubbed the display optimization problem, that captures a common aspect of choice behavior, known as the framing bias. In this setting, the objective is to optimize how distinct items (corresponding to products, web links, ads, etc.) are being displayed to a heterogeneous audience, whose choice preferences are influenced by the relative locations of items. Once items are assigned to vertically differentiated locations, customers consider a subset of the items displayed in the most favorable locations before picking an alternative through multinomial logit choice probabilities. The main contribution of this paper is to derive a polynomial-time approximation scheme for the display optimization problem. Our algorithm is based on an approximate dynamic programming formulation that exploits various structural properties to derive a compact state space representation of provably near-optimal item-to-position assignment decisions. As a byproduct, our results improve on existing constant-factor approximations for closely related models and apply to general distributions over consideration sets. We develop the notion of approximate assortments that may be of independent interest and applicable in additional revenue management settings. Lastly, we conduct extensive numerical studies to validate the proposed modeling approach and algorithm. Experiments on a public hotel booking data set demonstrate the superior predictive accuracy of our choice model vis-à-vis the multinomial logit choice model with location bias, proposed in earlier literature. In synthetic computational experiments, our approximation scheme dominates various benchmarks, including natural heuristics—greedy methods, local search, priority rules—and state-of-the-art algorithms developed for closely related models. This paper was accepted by Yinyu Ye, optimization.
1 October 2018 in Operations Research
We study the joint assortment planning and inventory management problem, where stock-out events elicit dynamic substitution effects, described by the multinomial logit (MNL) choice model. Special cases of this setting have been extensively studied in recent literature, notably the static assortment planning problem. Nevertheless, to our knowledge, the general formulation is not known to admit efficient algorithms with analytical performance guarantees before this work, and most of its computational aspects are still wide open.In this paper, we devise what is, to our knowledge, the first provably good approximation algorithm for dynamic assortment planning under the MNL model. We derive a constant-factor guarantee for a broad class of demand distributions that satisfy the increasing failure rate property. Our algorithm relies on a combination of greedy procedures, where stocking decisions are restricted to specific classes of products and the objective function takes modified forms. We demonstrate that our approach substantially outperforms state-of-the-art heuristic methods in terms of performance and speed, leading to an average revenue gain of 4% to 12% in computational experiments. In the course of establishing our main result, we develop new algorithmic ideas that may be of independent interest. These include weaker notions of submodularity and monotonicity, shown sufficient to obtain constant-factor worst-case guarantees, despite using noisy estimates of the objective function.
1 May 2019 in Mathematics of Operations Research
We consider the single-period joint assortment and inventory planning problem with stochastic demand and dynamic substitution across products, motivated by applications in highly differentiated markets, such as online retailing and airlines. This class of problems is known to be notoriously hard to deal with from a computational standpoint. In fact, prior to the present paper, only a handful of modeling approaches were shown to admit provably good algorithms, at the cost of strong restrictions on customers’ choice outcomes. Our main contribution is to provide the first efficient algorithms with provable performance guarantees for a broad class of dynamic assortment optimization models. Under general rank-based choice models, our approximation algorithm is best possible with respect to the price parameters, up to lower-order terms. In particular, we obtain a constant-factor approximation under horizontal differentiation, where product prices are uniform. In more structured settings, where the customers’ ranking behavior is motivated by price and quality cues, we derive improved guarantees through tailor-made algorithms. In extensive computational experiments, our approach dominates existing heuristics in terms of revenue performance, as well as in terms of speed, given the myopic nature of our methods. From a technical perspective, we introduce a number of novel algorithmic ideas of independent interest, and unravel hidden relations to submodular maximization.
27 August 2018 in Algorithmica