When sales of a product are affected by randomness in demand, retailers can use dynamic pricing strategies to maximise their profits. In this article the pricing problem is formulated as a stochastic optimal control problem, where the optimal policy can be found by solving the associated Bellman equation. The aim is to investigate Approximate Dynamic Programming algorithms for this problem. For realistic retail applications, modelling the problem and solving it to optimality is intractable. Thus practitioners make simplifying assumptions and design suboptimal policies, but a thorough investigation of the relative performance of these policies is lacking.
To better understand such assumptions, we simulate the performance of two algorithms on a one-product system. It is found that for more than half of the realisations of the random disturbance, the often-used, but approximate, Certainty Equivalent Control policy yields larger profits than an optimal, maximum expected-value policy. This approximate algorithm, however, performs significantly worse in the remaining realisations, which colloquially can be interpreted as a more risk-seeking attitude by the retailer. Another policy, Open-Loop Feedback Control, is shown to work well as a compromise between the Certainty Equivalent Control and the optimal policy.
An Integrated Optimization + Learning Approach to Optimal Dynamic Pricing for the Retailer with Multi-type Customers in Smart Grids
School of Engineering and Computing Sciences, Durham University(工程与计算科学学院,达勒姆大学);School of Computer Science, The University of Manchester(计算机科学学院,曼彻斯特大学);College of Information System and Management, National University of Defense Technology(信息系统与管理学院,国防科技大学);School of Mathematics, University of Edinburgh(数学学院,爱丁堡大学);School of Information and Control Engineering, China University of Mining and Technology(信息与控制工程学院,中国矿业大学)
Advancing Branch-and-Price for Graph Coloring: New Pricing Strategies and Benchmark Results
School of Management, Huazhong University of Science and Technology(华中科技大学管理学院);College of Science and Engineering, Hamad Bin Khalifa University(哈利法大学科学与工程学院);Department of Computer, Control, and Management Engineering “Antonio Ruberti”, Sapienza University of Rome(罗马大学安东尼奥·鲁贝蒂计算机、控制与管理工程学院)
Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing
Stern School of Business, New York University(纽约大学斯特恩商学院);China Europe International Business School (CEIBS)(中欧国际工商学院);Department of Management Science & Engineering, Stanford University(斯坦福大学管理科学与工程系)