mlsanityData to 7 Oct 2026

Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model

arXiv 2303.15652 ↗First posted 28 Mar 2023cs.LG cs.DScited by 0

Not on the map. Why?

Abstract (arXiv)

We consider dynamic pricing strategies in a streamed longitudinal data set-up where the objective is to maximize, over time, the cumulative profit across a large number of customer segments. We consider a dynamic model with the consumers' preferences as well as price sensitivity varying over time. Building on the well-known finding that consumers sharing similar characteristics act in similar ways, we consider a global shrinkage structure, which assumes that the consumers' preferences across the different segments can be well approximated by a spatial autoregressive (SAR) model. In such a streamed longitudinal set-up, 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. We propose a pricing policy based on penalized stochastic gradient descent (PSGD) and explicitly characterize its regret as functions of time, the temporal variability in the model parameters as well as the strength of the auto-correlation network structure spanning the varied customer segments. Our regret analysis results not only demonstrate asymptotic optimality of the proposed policy but also show that for policy planning it is essential to incorporate available structural information as policies based on unshrunken models are highly sub-optimal in the aforementioned set-up. We conduct simulation experiments across a wide range of regimes as well as real-world networks based studies and report encouraging performance for our proposed method.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 74 references that are in the map. First posted on arXiv 28 Mar 2023.

Builds on

11 of 74 references.

References · 11

  1. 2013Non-stationary Stochastic Optimizationcited by 173
  2. 2015Online Optimization : Competing with Dynamic Comparatorscited by 99
  3. 2016Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradientcited by 65
  4. 2016Dynamic Pricing in High-dimensionscited by 55
  5. 2020Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctionscited by 34
  6. 2016Multidimensional Binary Search for Contextual Decision-Makingcited by 27
  7. 2018Contextual Search via Intrinsic Volumescited by 26
  8. 2017Perishability of Data: Dynamic Pricing under Varying-Coefficient Modelscited by 19
  9. 2020Delay-Adaptive Learning in Generalized Linear Contextual Banditscited by 8
  10. 2015Group-Linear Empirical Bayes Estimates for a Heteroscedastic Normal Meancited by 4
  11. 2015Optimal shrinkage estimation in heteroscedastic hierarchical linear modelscited by 3

Built on by

Not cited yet.