Dynamic Pricing and Demand Learning on a Large Network of Products: A PAC-Bayesian Approach

• URL: http://arxiv.org/abs/2111.00790v1
• Date: Mon, 1 Nov 2021 09:37:36 GMT
• Title: Dynamic Pricing and Demand Learning on a Large Network of Products: A PAC-Bayesian Approach
• Authors: Bora Keskin, David Simchi-Levi, Prem Talwai
• Abstract summary: We consider a seller offering a network of $N$ products over a time horizon of $T$ periods. The seller does not know the parameters of the products' linear demand model. We propose a dynamic pricing-and-learning policy that combines the optimism-in-the-face-of-uncertainty and PAC-Bayesian.
• Score: 8.927163098772589
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider a seller offering a large network of $N$ products over a time horizon of $T$ periods. The seller does not know the parameters of the products' linear demand model, and can dynamically adjust product prices to learn the demand model based on sales observations. The seller aims to minimize its pseudo-regret, i.e., the expected revenue loss relative to a clairvoyant who knows the underlying demand model. We consider a sparse set of demand relationships between products to characterize various connectivity properties of the product network. In particular, we study three different sparsity frameworks: (1) $L_0$ sparsity, which constrains the number of connections in the network, and (2) off-diagonal sparsity, which constrains the magnitude of cross-product price sensitivities, and (3) a new notion of spectral sparsity, which constrains the asymptotic decay of a similarity metric on network nodes. We propose a dynamic pricing-and-learning policy that combines the optimism-in-the-face-of-uncertainty and PAC-Bayesian approaches, and show that this policy achieves asymptotically optimal performance in terms of $N$ and $T$. We also show that in the case of spectral and off-diagonal sparsity, the seller can have a pseudo-regret linear in $N$, even when the network is dense.

Related papers

• 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)
• Low-Rank Online Dynamic Assortment with Dual Contextual Information [12.373566593905792]
  We introduce a new low-rank dynamic assortment model to transform this problem into a manageable scale. We then propose an efficient algorithm that estimates the intrinsic subspaces and utilizes the upper confidence bound approach to address the exploration-exploitation trade-off in online decision making.
  arXiv  Detail & Related papers  (2024-04-19T23:10:12Z)
• Pricing with Contextual Elasticity and Heteroscedastic Valuation [23.96777734246062]
  We study an online contextual dynamic pricing problem, where customers decide whether to purchase a product based on its features and price. We introduce a novel approach to modeling a customer's expected demand by incorporating feature-based price elasticity. Our results shed light on the relationship between contextual elasticity and heteroscedastic valuation, providing insights for effective and practical pricing strategies.
  arXiv  Detail & Related papers  (2023-12-26T11:07:37Z)
• Dynamic Pricing and Learning with Bayesian Persuasion [18.59029578133633]
  We consider a novel dynamic pricing and learning setting where in addition to setting prices of products, the seller also ex-ante commits to 'advertising schemes' We use the popular Bayesian persuasion framework to model the effect of these signals on the buyers' valuation and purchase responses. We design an online algorithm that can use past purchase responses to adaptively learn the optimal pricing and advertising strategy.
  arXiv  Detail & Related papers  (2023-04-27T17:52:06Z)
• Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model [50.06663781566795]
  We consider a dynamic model with the consumers' preferences as well as price sensitivity varying over time. We measure the performance of a dynamic pricing policy via regret, which is the expected revenue loss compared to a clairvoyant that knows the sequence of model parameters in advance. Our regret analysis results not only demonstrate optimality of the proposed policy but also show that for policy planning it is essential to incorporate available structural information.
  arXiv  Detail & Related papers  (2023-03-28T00:23:23Z)
• Price DOES Matter! Modeling Price and Interest Preferences in Session-based Recommendation [55.0391061198924]
  Session-based recommendation aims to predict items that an anonymous user would like to purchase based on her short behavior sequence. It is nontrivial to incorporate price preferences for session-based recommendation. We propose a novel method Co-guided Heterogeneous Hypergraph Network (CoHHN) for session-based recommendation.
  arXiv  Detail & Related papers  (2022-05-09T10:47:15Z)
• Robustness Certificates for Implicit Neural Networks: A Mixed Monotone Contractive Approach [60.67748036747221]
  Implicit neural networks offer competitive performance and reduced memory consumption. They can remain brittle with respect to input adversarial perturbations. This paper proposes a theoretical and computational framework for robustness verification of implicit neural networks.
  arXiv  Detail & Related papers  (2021-12-10T03:08:55Z)
• Negotiating Networks in Oligopoly Markets for Price-Sensitive Products [2.4366811507669124]
  We present a novel framework to learn functions that estimate decisions of sellers and buyers simultaneously in an oligopoly market for a price-sensitive product. Similar to generative adversarial networks, this framework corresponds to a minimax two-player game.
  arXiv  Detail & Related papers  (2021-10-25T22:29:48Z)
• Do Wider Neural Networks Really Help Adversarial Robustness? [92.8311752980399]
  We show that the model robustness is closely related to the tradeoff between natural accuracy and perturbation stability. We propose a new Width Adjusted Regularization (WAR) method that adaptively enlarges $lambda$ on wide models.
  arXiv  Detail & Related papers  (2020-10-03T04:46:17Z)
• On the Difference Between the Information Bottleneck and the Deep Information Bottleneck [81.89141311906552]
  We revisit the Deep Variational Information Bottleneck and the assumptions needed for its derivation. We show how to circumvent this limitation by optimising a lower bound for $I(T;Y)$ for which only the latter Markov chain has to be satisfied.
  arXiv  Detail & Related papers  (2019-12-31T18:31:42Z)

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.