Price Optimization Under the Finite-Mixture Logit Model
研究了有限混合Logit模型下的价格优化问题，提出一种算法，能在客户数量大但细分市场少时快速得到接近最优的价格，数值实验表明忽略细分或使用启发式方法会损失收益。
We consider price optimization under the finite-mixture logit model. This model assumes that customers belong to one of a number of customer segments, where each customer segment chooses according to a multinomial logit model with segment-specific parameters. We reformulate the corresponding price optimization problem and develop a novel characterization. Leveraging this new characterization, we construct an algorithm that obtains prices at which the revenue is guaranteed to be at least [Formula: see text] times the maximum attainable revenue for any prespecified [Formula: see text]. Existing global optimization methods require exponential time in the number of products to obtain such a result, which practically means that the prices of only a handful of products can be optimized. The running time of our algorithm, however, is exponential in the number of customer segments and only polynomial in the number of products. This is of great practical value, because in applications, the number of products can be very large, whereas it has been found in various contexts that a low number of segments is sufficient to capture customer heterogeneity appropriately. The results of our numerical study show that (i) ignoring customer segmentation can be detrimental for the obtained revenue, (ii) heuristics for optimization can get stuck in local optima, and (iii) our algorithm runs fast on a broad range of problem instances. This paper was accepted by Omar Besbes, revenue management and market analytics.