arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.12562cs.LGcs.GT
收藏

具有长期参考效应的动态定价与学习

Dynamic Pricing and Learning with Long-term Reference Effects

Columbia University(哥伦比亚大学)

Shipra Agrawal, Wei Tang

AI总结:

本文研究参考价格为历史平均价格的动态定价与学习问题,证明降价策略近乎最优,并为线性需求模型提供高效学习算法,实现最优遗憾上界。

摘要:

我们考虑一个动态定价问题,其中客户对当前价格的响应受到客户价格预期(即参考价格)的影响。我们研究了一种简单而新颖的参考价格机制,其中参考价格是卖方过去所提供价格的平均值。与更常研究的指数平滑机制相比,在我们的参考价格机制中,卖方提供的价格对未来客户预期具有更长期的影响。我们证明,在这种机制下,降价策略无论模型参数如何都是近乎最优的。这符合常见的直觉,即卖方从较高的价格开始然后降低价格可能更有利,因为客户会感觉他们在通常更昂贵的商品上获得了优惠。对于线性需求模型,我们还提供了近乎最优降价策略的详细刻画以及计算该策略的有效方法。然后,我们考虑一个更具挑战性的动态定价与学习问题,其中需求模型参数先验未知,卖方需要根据客户对提供价格的响应在线学习这些参数,同时优化收入。目标是使遗憾最小化,即与一个全知最优策略相比的T轮收入损失。这项任务实质上相当于在时变马尔可夫决策过程(MDP)中学习一个非平稳的最优策略。对于线性需求模型,我们提供了一种高效的学习算法,并给出了最优的$\tilde{O}(\sqrt{T})$遗憾上界。

英文摘要:

We consider a dynamic pricing problem where customer response to the current price is impacted by the customer price expectation, aka reference price. We study a simple and novel reference price mechanism where reference price is the average of the past prices offered by the seller. As opposed to the more commonly studied exponential smoothing mechanism, in our reference price mechanism the prices offered by seller have a longer term effect on the future customer expectations. We show that under this mechanism, a markdown policy is near-optimal irrespective of the parameters of the model. This matches the common intuition that a seller may be better off by starting with a higher price and then decreasing it, as the customers feel like they are getting bargains on items that are ordinarily more expensive. For linear demand models, we also provide a detailed characterization of the near-optimal markdown policy along with an efficient way of computing it. We then consider a more challenging dynamic pricing and learning problem, where the demand model parameters are apriori unknown, and the seller needs to learn them online from the customers' responses to the offered prices while simultaneously optimizing revenue. The objective is to minimize regret, i.e., the $T$-round revenue loss compared to a clairvoyant optimal policy. This task essentially amounts to learning a non-stationary optimal policy in a time-variant Markov Decision Process (MDP). For linear demand models, we provide an efficient learning algorithm with an optimal $\tilde{O}(\sqrt{T})$ regret upper bound.

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

↑