paper-with-me

홈 › Papers

Online Learning and Optimization for Revenue Management Problems with Add-on Discounts

2020-05-02 · David Simchi-Levi, Rui Sun, Huanan Zhang

We study in this paper a revenue management problem with add-on discounts. The problem is motivated by the practice in the video game industry, where a retailer offers discounts on selected supportive products (e.g. video games) to customers who have also purchased the core products (e.g. video game consoles). We formulate this problem as an optimization problem to determine the prices of different products and the selection of products with add-on discounts. To overcome the computational challenge of this optimization problem, we propose an efficient FPTAS algorithm that can solve the problem approximately to any desired accuracy. Moreover, we consider the revenue management problem in the setting where the retailer has no prior knowledge of the demand functions of different products. To resolve this problem, we propose a UCB-based learning algorithm that uses the FPTAS optimization algorithm as a subroutine. We show that our learning algorithm can converge to the optimal algorithm that has access to the true demand functions, and we prove that the convergence rate is tight up to a certain logarithmic term. In addition, we conduct numerical experiments with the real-world transaction data we collect from a popular video gaming brand's online store on Tmall.com. The experiment results illustrate our learning algorithm's robust performance and fast convergence in various scenarios. We also compare our algorithm with the optimal policy that does not use any add-on discount, and the results show the advantages of using the add-on discount strategy in practice.

📄 PDF Abstract BibTeX arXiv:2005.00947

Code (0)

등록된 구현이 없습니다.

Tasks

Management

Similar Papers 제목 키워드 기반

The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems

2020-11-18 · Santiago Balseiro, Haihao Lu, Vahab Mirrokni

Online allocation problems with resource constraints are central problems in revenue management and online advertising. In these problems, requests arrive sequentially during a finite horizon and, for each request, a dec…

Assortment OptimizationManagement

Single-Leg Revenue Management with Advice

2022-02-18 · Santiago Balseiro, Christian Kroer, Rachitesh Kumar

Single-leg revenue management is a foundational problem of revenue management that has been particularly impactful in the airline and hotel industry: Given $n$ units of a resource, e.g. flight seats, and a stream of sequ…

Management

Multi-Armed Bandits with Network Interference

2024-05-28 · Abhineet Agarwal, Anish Agarwal, Lorenzo Masoero, Justin Whitehouse

Online experimentation with interference is a common challenge in modern applications such as e-commerce and adaptive clinical trials in medicine. For example, in online marketplaces, the revenue of a good depends on dis…

Multi-Armed Bandits

E-Commerce Promotions Personalization via Online Multiple-Choice Knapsack with Uplift Modeling

2021-08-11 · Javier Albert, Dmitri Goldenberg

Promotions and discounts are essential components of modern e-commerce platforms, where they are often used to incentivize customers towards purchase completion. Promotions also affect revenue and may incur a monetary lo…

Multiple-choice

Reinforcement Learning for Intensity Control: An Application to Choice-Based Network Revenue Management

2024-06-08 · Huiling Meng, Ningyuan Chen, Xuefeng Gao

Intensity control is a type of continuous-time dynamic optimization problems with many important applications in Operations Research including queueing and revenue management. In this study, we adapt the reinforcement le…

Managementreinforcement-learningReinforcement Learning