# Privacy-Preserving Dynamic Personalized Pricing with Demand Learning

@article{Chen2020PrivacyPreservingDP,
title={Privacy-Preserving Dynamic Personalized Pricing with Demand Learning},
author={Xi Chen and David Simchi-Levi and Yining Wang},
journal={ArXiv},
year={2020},
volume={abs/2009.12920}
}
• Published 27 September 2020
• Computer Science
• ArXiv
The prevalence of e-commerce has made customers’ detailed personal information readily accessible to retailers, and this information has been widely used in pricing decisions. When using personalized information, the question of how to protect the privacy of such information becomes a critical issue in practice. In this paper, we consider a dynamic pricing problem over T time periods with an unknown demand function of posted price and personalized information. At each time t, the retailer…

## Figures and Tables from this paper

Privacy-Preserving Personalized Revenue Management
• Computer Science
• 2020
This paper examines how data-driven personalized decisions can be made while preserving consumer privacy, and develops privacy-preserving personalized pricing algorithms and derives the theoretical bounds on their performance as measured by the firm's revenue.
Differential Privacy in Personalized Pricing with Nonparametric Demand Models
• Computer Science
SSRN Electronic Journal
• 2021
Two algorithms are developed which make pricing decisions and learn the unknown demand on the fly, while satisfying the CDP and LDP gurantees respectively, and prove a lower bound of $\Omega(\varepsilon^{-2/(d+2)}T^{(d+1)/(d-2)})$ for any algorithm with LDP guarantee.
Fairness-aware Online Price Discrimination with Nonparametric Demand Models
• Computer Science
SSRN Electronic Journal
• 2021
This work proposes an optimal dynamic pricing policy in terms of regret, which enforces the strict price fairness constraint, and extends the algorithm to a more general notion of fairness, which includes demand fairness as a special case.
Optimal and Differentially Private Data Acquisition: Central and Local Mechanisms
• Computer Science, Mathematics
ArXiv
• 2022
This work considers a platform’s problem of collecting data from privacy sensitive users to estimate an underlying parameter of interest as a Bayesian-optimal mechanism design problem, and develops efficient algorithmic mechanisms to solve this problem in both privacy settings.
Context-Based Dynamic Pricing with Online Clustering
Production and Operations Management
• 2022
The result shows that when product demand functions come from multiple clusters, the algorithms significantly outperform traditional single-product pricing policies and is an effective approach to tackling dynamic pricing problems associated with low-sale products.
Optimal Policies for Dynamic Pricing and Inventory Control with Nonparametric Censored Demands
• Computer Science
• 2020
A novel inversion method based on empirical measures to consistently estimate the difference of the instantaneous reward functions at two prices is proposed, directly tackling the fundamental challenge brought by censored demands, without raising the order-up-to levels to unnaturally high levels to collect more demand information.
Generalized Linear Bandits with Local Differential Privacy
• Computer Science
NeurIPS
• 2021
This paper designs LDP algorithms for stochastic generalized linear bandits to achieve the same regret bound as in non-privacy settings and develops an estimator and update mechanism based on Ordinary Least Square for linear bandits.
Online Regularization towards Always-Valid High-Dimensional Dynamic Pricing
• Computer Science
• 2020
This paper makes the decisive observation that the always-validity of pricing decisions builds and thrives on the online regularization scheme, and proposes an optimistic online Lasso procedure that resolves dynamic pricing problems at the process level, based on a novel use of non-asymptotic martingale concentration.
On Private Online Convex Optimization: Optimal Algorithms in $\ell_p$-Geometry and High Dimensional Contextual Bandits
• Computer Science
• 2022
This paper proposes a private variant of online Frank-Wolfe algorithm with recursive gradients for variance reduction to update and reveal the parameters upon each data, and designs the first DP algorithm for high-dimensional generalized linear bandits with logarithmic regret.
Limits of Personalization: Prophet Inequalities for Revenue-Ordered Assortments
SSRN Electronic Journal
• 2021
Consider a clairvoyant firm that knows the products’ valuations of each arriving consumer and offers them only the most profitable product they are willing to buy. How much more can such a firm make

## References

SHOWING 1-10 OF 69 REFERENCES
Differentially Private Contextual Dynamic Pricing
AAMAS
• 2020
An algorithm is presented that is ε-differentially private and achieves expected regret Õ, where d is the dimension of product features andT is the time horizon, and the goal is to maximize the seller’s payoff and minimize the regret when knowing the distribution of buyers’ preferences.
Personalized Dynamic Pricing with Machine Learning: High Dimensional Features and Heterogeneous Elasticity
• Computer Science
• 2020
This work considers a seller who can dynamically adjust the price of a product at the individual customer level, by utilizing information about customers’ characteristics encoded as a d-dimensional feature vector, and designs a near-optimal pricing policy for a “semi-clairvoyant” seller that achieves an expected regret of order s √Tlog T.
Dynamic Pricing and Demand Learning with Limited Price Experimentation
• Computer Science
• 2017
A pricing policy is demonstrated that incurs a regret of O(log^(m) T), or m iterations of the logarithm, and it is shown that this regret is the smallest possible up to a constant factor.
Dynamic Pricing Under a General Parametric Choice Model
• Economics
Oper. Res.
• 2012
A stylized dynamic pricing model in which a monopolist prices a product to a sequence of T customers who independently make purchasing decisions based on the price offered according to a general parametric choice model shows that the regret of the optimal pricing policy in this model is $\Theta(\sqrt T)$.
Thompson Sampling for Online Personalized Assortment Optimization Problems with Multinomial Logit Choice Models
• Computer Science
• 2017
This work derives bounds on the revenue loss, namely Bayesian regret, incurred by policy Pao-Ts, in comparison to the optimal policy which is provided with the latent models, where surrogate models for the latent choice models are constructed using samples from a progressively updated posterior distribution.
Dynamic Pricing for Nonperishable Products with Demand Learning
Oper. Res.
• 2009
The retailer's problem is formulated as a (Poisson) intensity control problem and the structural properties of an optimal solution are derived, and a simple and efficient approximated solution is suggested.
Dynamic Pricing in High-Dimensions
• Computer Science
J. Mach. Learn. Res.
• 2019
A dynamic policy is proposed, called Regularized Maximum Likelihood Pricing (RMLP) that leverages the (sparsity) structure of the high-dimensional model and obtains a logarithmic regret in T, and it is shown that no policy can obtain regret better than RMLP.
Dynamic Pricing with a Prior on Market Response