arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1702.03700math.OCcs.CC
收藏

单一过渡模型下的产品组合Optimization

Assortment Optimization under a Single Transition Model

Kameng Nip, Zhenbo Wang, Zizhuo Wang

摘要:

本文考虑一个单转移的马尔可夫链选择模型。在这个模型中,客户以一定的概率到达每个产品。如果到达的产品是不可用的,则销售者可以向客户推荐可用产品的子集,并且客户将购买推荐产品中的一个或者以特定转移概率选择不购买。该模型的显着特点是,卖方可以根据到达的产品来控制推荐哪些产品,每个客户要么购买产品,要么在一次过渡后离开市场。在此模型下研究了产品的品种最优化问题。特别是,我们表明,这个问题一般是NP-难的,即使每个产品只能过渡到最多两个产品。尽管问题的复杂性,我们提供了多项式时间算法的几个特殊情况下,如当转移概率是均匀的相对于起点,或当每个产品只能过渡到一个其他产品。我们还为按收入排序的调整提供了严格的性能约束。此外,我们提出了一个紧凑的混合整数规划制定,可以解决这个问题的大尺寸。通过大量的数值实验,我们表明,所提出的算法可以有效地解决问题,所得到的修正可以显着提高卖方的收入比马尔可夫链选择模型。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑