17 research outputs found
Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences
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 by-product, 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-a-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 -- as well as state-of-the-art algorithms developed for closely-related models
The ordered k-median problem: surrogate models and approximation algorithms
In the last two decades, a steady stream of research has been devoted to studying various computational aspects of the ordered k-median problem, which subsumes traditional facility location problems (such as median, center, p-centrum, etc.) through a unified modeling approach. Given a finite metric space, the objective is to locate k facilities in order to minimize the ordered median cost function. In its general form, this function penalizes the coverage distance of each vertex by a multiplicative weight, depending on its ranking (or percentile) in the ordered list of all coverage distances. While antecedent literature has focused on mathematical properties of ordered median functions, integer programming methods, various heuristics, and special cases, this problem was not studied thus far through the lens of approximation algorithms. In particular, even on simple network topologies, such as trees or line graphs, obtaining non-trivial approximation guarantees is an open question. The main contribution of this paper is to devise the first provably-good approximation algorithms for the ordered k-median problem. We develop a novel approach that relies primarily on a surrogate model, where the ordered median function is replaced by a simplified ranking-invariant functional form, via efficient enumeration. Surprisingly, while this surrogate model is Ω(nΩ(1)) -hard to approximate on general metrics, we obtain an O(logn) -approximation for our original problem by employing local search methods on a smooth variant of the surrogate function. In addition, an improved guarantee of 2+ϵ is obtained on tree metrics by optimally solving the surrogate model through dynamic programming. Finally, we show that the latter optimality gap is tight up to an O(ϵ) term
Greedy-Like Algorithms for Dynamic Assortment Planning Under Multinomial Logit Preferences
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 functio
Approximation algorithms for dynamic assortment optimization models
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
The Approximability of Assortment Optimization Under Ranking Preferences
The main contribution of this paper is to provide best-possible approximability bounds for assortment planning under a general choice model, where customer choices are modeled through an arbitrary distribution over ranked lists of their preferred products, subsuming most random utility choice models of interest. From a technical perspective, we show how to relate this optimization problem to the computational task of detecting large independent sets in graphs, allowing us to argue that general ranking preferences are extremely hard to approximate with respect to various problem parameters. These findings are complemented by a number of approximation algorithms that attain essentially best-possible factors, proving that our hardness results are tight up to lower-order terms. Surprisingly, our results imply that a simple and widely studied policy, known as revenue-ordered assortments, achieves the best possible performance guarantee with respect to the price parameters
The stability of MNL-based demand under dynamic customer substitution and its algorithmic implications
We study the dynamic assortment planning problem under the widely utilized multinomial logit choice model (MNL). In this single-period assortment optimization and inventory management problem, the retailer jointly decides on an assortment, that is, a subset of products to be offered, as well as on the inventory levels of these products, aiming to maximize the expected revenue subject to a capacity constraint on the total number of units stocked. The demand process is formed by a stochastic stream of arriving customers, who dynamically substitute between products according to the MNL model. Although this dynamic setting is extensively studied, the best known approximation algorithm guarantees an expected revenue of at least 0.139 times the optimum, assuming that the demand distribution has an increasing failure rate. In this paper, we establish novel stochastic inequalities showing that, for any given inventory levels, the expected demand of each offered product is “stable” under basic algorithmic operations, such as scaling the MNL preference weights and shifting inventory across comparable products. We exploit this sensitivity analysis to devise the first approximation scheme for dynamic assortment planning under the MNL model, allowing one to efficiently compute inventory levels that approach the optimal expected revenue within any degree of accuracy. The running time of this algorithm is polynomial in all instance parameters except for an exponential dependency on log Δ, where Δ=wmaxwmin stands for the ratio of the extremal MNL preference weights. Finally, we conduct simulations on simple synthetic instances with uniform preference weights (i.e., Δ=1). Using our approximation scheme to derive tight upper bounds, we gain some insights into the performance of several heuristics proposed by previous literature
The Stability of MNL-Based Demand under Dynamic Customer Substitution and its Algorithmic Implications
Technical Note - An Approximate Dynamic Programming Approach to The Incremental Knapsack Problem
We study the incremental knapsack problem, where one wishes to sequentially pack items into a knapsack whose capacity expands over a finite planning horizon, with the objective of maximizing time-averaged profits. While various approximation algorithms were developed under mitigating structural assumptions, obtaining non-trivial performance guarantees for this problem in its utmost generality has remained an open question thus far. In this paper, we devise a polynomial-time approximation scheme for general instances of the incremental knapsack problem, which is the strongest guarantee possible given existing hardness results. In contrast to earlier work, our algorithmic approach exploits an approximate dynamic programming formulation. Starting with a simple exponentially sized dynamic program, we prove that an appropriate composition of state pruning ideas yields a polynomially sized state space with negligible loss of optimality. The analysis of this formulation synthesizes various techniques, including new problem decompositions, parsimonious counting arguments, and efficient rounding methods, that may be of broader interest
The exponomial choice model for assortment optimization: an alternative to the MNL model?
In this paper, we consider the yet-uncharted assortment optimization problem under the Exponomial choice model, where the objective is to determine the revenue maximizing set of products that should be offered to customers. Our main algorithmic contribution comes in the form of a fully polynomial-time approximation scheme (FPTAS), showing that the optimal expected revenue can be efficiently approached within any degree of accuracy. This result is obtained through a synthesis of ideas related to approximate dynamic programming, that enable us to derive a compact discretization of the continuous state space by keeping track of several key statistics in "rounded" form throughout the overall computation. Consequently, we obtain the first provably-good algorithm for assortment optimization under the Exponomial choice model, which is complemented by a number of hardness results for natural extensions. We show in computational experiments that our solution method admits an efficient implementation, based on additional pruning criteria. Furthermore, in light of recent empirical evidence in this context, we evaluate the Exponomial choice model from a data-driven perspective. We present two case studies, the first of which revolves around a contemporary setting, where users of a transit app are selecting from amongst a collection of potential travel modes, and the second is more traditional in nature, being focused on a purchase data setting in retail. We find the prediction power and accuracy of the Exponomial choice model in both studies to be on par with those produced by the Multinomial Logit model
Approximation Algorithms for Dynamic Assortment Optimization Models
© 2018 INFORMS 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