Nonparametric pricing analytics with customer covariates

DOI10.1287/OPRE.2020.2016MaRDI QIDQ5003728zbMATH OpenOpenAlexFDO

Authors Ningyuan Chen, Guillermo Gallego

Publication date 29 July 2021

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.01136

zbMATH Keywords

contextual informationdynamic pricingmulti-armed banditonline learningregret analysis

Mathematics Subject Classification ID

Microeconomic theory (price theory and economic markets) (91B24) Consumer behavior, demand theory (91B42)

Abstract: Personalized pricing analytics is becoming an essential tool in retailing. Upon observing the personalized information of each arriving customer, the firm needs to set a price accordingly based on the covariates such as income, education background, past purchasing history to extract more revenue. For new entrants of the business, the lack of historical data may severely limit the power and profitability of personalized pricing. We propose a nonparametric pricing policy to simultaneously learn the preference of customers based on the covariates and maximize the expected revenue over a finite horizon. The policy does not depend on any prior assumptions on how the personalized information affects consumers' preferences (such as linear models). It is adaptively splits the covariate space into smaller bins (hyper-rectangles) and clusters customers based on their covariates and preferences, offering similar prices for customers who belong to the same cluster trading off granularity and accuracy. We show that the algorithm achieves a regret of order $O(log(T{)}^2{T}^{(2+d)/(4+d)})$, where $T$ is the length of the horizon and $d$ is the dimension of the covariate. It improves the current regret in the literature citep{slivkins2014contextual}, under mild technical conditions in the pricing context (smoothness and local concavity). We also prove that no policy can achieve a regret less than $O(T^{(2+d)/(4+d)})$ for a particular instance and thus demonstrate the near optimality of the proposed policy.

Recommendations

• Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning
• Dynamic pricing in high-dimensions
• Dynamic pricing under a general parametric choice model
• A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint
• Dynamic pricing with finite price sets: a non-parametric approach

Cites work

• X-armed bandits
• A linear response bandit problem
• Blind network revenue management
• Close the gaps: a learning-while-doing algorithm for single-product revenue management problems
• Contextual bandits with similarity information
• Dynamic pricing for nonperishable products with demand learning
• Dynamic pricing under a general parametric choice model
• Dynamic pricing with a prior on market response
• Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies
• Dynamic pricing without knowing the demand function: risk bounds and near-optimal algorithms
• scientific article; zbMATH DE number 5485582 (Why is no real title available?)
• Improved Rates for the Stochastic Continuum-Armed Bandit Problem
• Online decision making with high-dimensional covariates
• Optimal aggregation of classifiers in statistical learning.
• Prediction, Learning, and Games
• Randomized allocation with nonparametric estimation for a multi-armed bandit problem with covariates
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• Technical note: Dynamic pricing and demand learning with limited price experimentation
• The Continuum-Armed Bandit Problem
• The elements of statistical learning. Data mining, inference, and prediction
• The multi-armed bandit problem with covariates
• Woodroofe's one-armed bandit problem revisited

Cited in

(5)

• A Nonparametric Approach to Multiproduct Pricing
• A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint
• Policy Optimization Using Semiparametric Models for Dynamic Pricing
• Differential Privacy in Personalized Pricing with Nonparametric Demand Models
• Online learning and pricing for multiple products with reference price effects

This page was built for publication: Nonparametric pricing analytics with customer covariates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5003728)