Online Dynamic Pricing of Complementary Products

• URL: http://arxiv.org/abs/2511.22291v1
• Date: Thu, 27 Nov 2025 10:12:51 GMT
• Title: Online Dynamic Pricing of Complementary Products
• Authors: Marco Mussi, Marcello Restelli,
• Abstract summary: We present an online learning algorithm considering both positive and negative interactions between products' demands.<n>Our solution improves the revenue w.r.t. a comparable learning algorithm ignoring such interactions.
• Score: 45.90621357073487
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Traditional pricing paradigms, once dominated by static models and rule-based heuristics, are increasingly being replaced by dynamic, data-driven approaches powered by machine learning algorithms. Despite their growing sophistication, most dynamic pricing algorithms focus on optimizing the price of each product independently, disregarding potential interactions among items. By neglecting these interdependencies in consumer demand across related goods, sellers may fail to capture the full potential of coordinated pricing strategies. In this paper, we address this problem by exploring dynamic pricing mechanisms designed explicitly for complementary products, aiming to exploit their joint demand structure to maximize overall revenue. We present an online learning algorithm considering both positive and negative interactions between products' demands. The algorithm utilizes transaction data to identify advantageous complementary relationships through an integer programming problem between different items, and then optimizes pricing strategies using data-driven and computationally efficient multi-armed bandit solutions based on heteroscedastic Gaussian processes. We validate our solution in a simulated environment, and we demonstrate that our solution improves the revenue w.r.t. a comparable learning algorithm ignoring such interactions.

Related papers

• Direct comparison of stochastic driven nonlinear dynamical systems for combinatorial optimization [0.669087470775851]
  Combinatorial optimization problems are ubiquitous in industrial applications.<n>Tremendous effort has been devoted to developing solvers for Ising-type problems over the past decades.<n>Recent advances in controlling and manipulating both quantum and classical systems have enabled novel computing paradigms.
  arXiv  Detail & Related papers  (2025-03-19T17:08:55Z)
• Joint Pricing and Resource Allocation: An Optimal Online-Learning Approach [20.70943884841438]
  We study an online learning horizon where we make joint pricing and inventory decisions to maximize the overall net profit.<n>We develop an efficient algorithm that utilizes a "Confidence Bound" strategy over multiple OCO.
  arXiv  Detail & Related papers  (2025-01-29T23:23:54Z)
• Dual-Agent Deep Reinforcement Learning for Dynamic Pricing and Replenishment [15.273192037219077]
  We study the dynamic pricing and replenishment problems under inconsistent decision frequencies. We integrate a decision tree-based machine learning approach, trained on comprehensive market data. In this approach, two agents handle pricing and inventory and are updated on different scales.
  arXiv  Detail & Related papers  (2024-10-28T15:12:04Z)
• Dynamic Pricing for Electric Vehicle Charging [6.1003048508889535]
  We develop a novel formulation for the dynamic pricing problem by addressing multiple conflicting objectives efficiently. A dynamic pricing model quantifies the relationship between demand and price while simultaneously solving multiple conflicting objectives. Two California charging sites' real-world data validates our approach.
  arXiv  Detail & Related papers  (2024-08-26T10:32:21Z)
• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• Contractual Reinforcement Learning: Pulling Arms with Invisible Hands [68.77645200579181]
  We propose a theoretical framework for aligning economic interests of different stakeholders in the online learning problems through contract design. For the planning problem, we design an efficient dynamic programming algorithm to determine the optimal contracts against the far-sighted agent. For the learning problem, we introduce a generic design of no-regret learning algorithms to untangle the challenges from robust design of contracts to the balance of exploration and exploitation.
  arXiv  Detail & Related papers  (2024-07-01T16:53:00Z)
• Switchable Decision: Dynamic Neural Generation Networks [98.61113699324429]
  We propose a switchable decision to accelerate inference by dynamically assigning resources for each data instance. Our method benefits from less cost during inference while keeping the same accuracy.
  arXiv  Detail & Related papers  (2024-05-07T17:44:54Z)
• Machine Learning Insides OptVerse AI Solver: Design Principles and Applications [74.67495900436728]
  We present a comprehensive study on the integration of machine learning (ML) techniques into Huawei Cloud's OptVerse AI solver. We showcase our methods for generating complex SAT and MILP instances utilizing generative models that mirror multifaceted structures of real-world problem. We detail the incorporation of state-of-the-art parameter tuning algorithms which markedly elevate solver performance.
  arXiv  Detail & Related papers  (2024-01-11T15:02:15Z)
• Algorithmic Collusion or Competition: the Role of Platforms' Recommender Systems [2.2706058775017217]
  Online platforms commonly deploy recommender systems that influence how consumers discover and purchase products.<n>We propose a novel repeated game framework that integrates several key components.<n>We show that a revenue-maximizing recommender system intensifies algorithmic collusion, whereas a utility-maximizing recommender system encourages more competitive pricing behavior among sellers.
  arXiv  Detail & Related papers  (2023-09-25T21:45:30Z)
• Dynamic Federated Learning [57.14673504239551]
  Federated learning has emerged as an umbrella term for centralized coordination strategies in multi-agent environments. We consider a federated learning model where at every iteration, a random subset of available agents perform local updates based on their data. Under a non-stationary random walk model on the true minimizer for the aggregate optimization problem, we establish that the performance of the architecture is determined by three factors, namely, the data variability at each agent, the model variability across all agents, and a tracking term that is inversely proportional to the learning rate of the algorithm.
  arXiv  Detail & Related papers  (2020-02-20T15:00:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.