Contextual Dynamic Pricing
Latest papers
9 papers3 papers in the last four weeks, with none the four weeks before. 0.0% of all new papers.
Across diverse markets, it is important for firms to balance attracting customers with managing operational conditions, such as workloads and delivery times. Dynamic pricing plays a central role in this tradeoff, as the orders generated today can change the conditions faced by future customers. We develop a novel framework for contextual dynamic pricing with an observed shared state and unknown purchase-driven transitions. The valuation model allows unknown mean functions of customer covariates and state, unknown state-specific scales and a common unknown standardized noise distribution. We propose Shadow-Adjusted Pricing in Evolving Systems (SHAPE), which incorporates a purchase's future revenue consequences into current pricing. Purchase-shadow adjustment and scale standardization reveal a common one-dimensional oracle price map across states, allowing SHAPE to retain its pricing history across value updates without repeating coarse exploration. The same active sales records support price-map learning and joint updates of continuation values and purchase shadows, without fitting the noise distribution or full transition matrices. To support this reuse under purchase-driven feedback, we establish pricing guarantees for history-dependent inputs and stability bounds for the joint updates. Under regularity, coverage and design conditions, we obtain sublinear expected regret against a finite-horizon dynamic oracle for linear, Hölder and sparse linear mean models. For affine valuations at fixed state and feature dimensions, SHAPE matches the static semiparametric minimax time exponent up to logarithmic factors for every fixed noise-tail smoothness order . Numerical experiments further demonstrate the appealing performance of SHAPE.
Optimal Contextual Pricing in Non-Stationary Environments
We study contextual dynamic pricing in a non-stationary environment. In each round, a seller observes a buyer's context, posts a price, and receives only binary purchase feedback. The buyer's value is linear in the context and an unobserved feature vector that may change over time, subject to a known total variation budget . We measure dynamic regret against the first-best benchmark that extracts each buyer's full value. For identical contexts, we develop a deterministic algorithm that combines binary-search exploration, lower-envelope pricing, and periodic and inconsistency-triggered restarts. It achieves regret . With heterogeneous contexts, a new geometric difficulty arises: small feature changes can leave a relaxed feasible set narrow but far from the current feature vector. We address this difficulty through a multiscale shallow-pricing algorithm that maintains relaxed feasible sets and enclosing ellipsoids at several variation scales. Larger scales provide reliable localization certificates, while the smallest active scale determines the exploitation price. The algorithm achieves dynamic regret , where is the context dimension. For fixed , both guarantees match the lower bound up to logarithmic factors in , establishing near-optimality among deterministic algorithms for every , including the stationary case.
SALE: Source-Aware Dynamic Pricing with Strategic Buyers
In modern commerce, firms and platforms typically use customer features from different sources to personalize prices: some features are verified using seller records or third-party data, while others are self-reported and may be strategically manipulated by buyers seeking lower prices. In this paper, we study the problem of source-aware dynamic pricing with strategic buyers, where the buyer's valuation is a sparse linear function of her high-dimensional features plus market noise with an unknown distribution. We develop the Source-Aware Localized exploration and calibrated Exploitation (SALE) policy, which personalizes exploration using past learning and verified features, and corrects for strategic manipulation using verified and reported features during exploitation. Our novel personalized design aims to narrow the range of prices explored, reducing unnecessary exploration at excessively high or low prices. To support learning under this design, we derive a new population equation that enables sparse valuation parameter estimation and, in turn, nonparametric estimation of the unknown noise distribution, even when buyer features are dependent over time. By uncovering the intrinsic sparse structure, our analysis establishes estimation guarantees for both learning tasks using the same exploration data. With these guarantees, we show that SALE achieves a sublinear expected regret bound, explicitly quantifying the benefit of using verified features to narrow exploration intervals. Several numerical studies further demonstrate the appealing performance of SALE.
Nonparametric Contextual Pricing and Inventory Learning under Censored Demand
In online retailing, when a product sells out, a retailer often sees only the units sold, not how many customers would have bought it had inventory been available. However, the inventory level determines how much demand is revealed, and this information can influence subsequent decisions and future profits. We study an online selling problem in which, in each round, the seller observes a market context and then makes pricing and stocking decisions based on censored sales data from previous rounds. The challenge is to learn a context-dependent pricing and stocking policy without assuming a particular formula for demand or observing realized profit. To overcome this difficulty, we propose a Mean-Calibrated Kernel UCB (MCK-UCB) algorithm that turns each incomplete sales record into a reliable guide for both inventory and price decisions, using data from past rounds with similar market conditions. This design allows us to learn while serving customers, without a separate exploration phase or the need to recover all demand hidden by stockouts. We prove the minimax optimality of the proposed algorithm, with strictly faster rates when expected profit varies more smoothly with price. Comprehensive numerical experiments have been conducted to confirm the effectiveness of the proposed algorithm.
Minimax-Optimal Semiparametric Contextual Dynamic Pricing with Multimodal Revenue
We study contextual dynamic pricing with arbitrary covariate sequences and bounded, possibly nonbinary purchase quantities. Demand follows a semiparametric surplus-index model with an unknown linear valuation parameter and an unknown Hölder-smooth response. We impose neither concavity nor strong unimodality on revenue and allow nonunique optimal prices. We develop a pilot-corrected layered decision-partitioning policy that combines directional pilot estimation, local polynomial learning, predictable data assignment, and global action elimination. Pilot correction removes the first-order effect of valuation-parameter error, while permanent labels enable concentration under adaptive sampling. The policy attains the minimax smoothness-dependent horizon rate up to logarithmic factors; a matching lower bound already holds for a constant-context binary-demand subclass.
On Non-Stationary Dynamic Pricing: Adaptivity and Optimality
We study the contextual dynamic pricing problem under non-stationarity, where a firm sells products to sequentially arriving consumers that behave according to an unknown demand model that can change over time. The demand model is assumed to be a generalized linear model (GLM), allowing for a feature vector in that encodes products and consumer information. To achieve optimal revenue (i.e., least regret), the firm needs to learn and exploit the unknown GLMs while monitoring for potential changes. We propose a multiscale change-point detection based algorithm that achieves a regret of order , where is the number of piecewise stationary segments and is a newly defined notion of design-adjusted variation budget of model parameters. Our algorithm is adaptive and does not require knowing or . Moreover, to our knowledge, this is the first dynamic pricing algorithm that is adaptive to the nature of changes and achieves the best-of-both-worlds rate, thus closing a long-standing gap in the literature. We remark that, due to the varying contexts, existing works in the adaptive non-stationary bandit literature cannot be applied to achieve optimality for contextual dynamic pricing. The regret is further accompanied with a newly constructed minimax lower bound, confirming the optimality of our algorithm (up to logarithmic factors). Extensive numerical experiments are conducted to illustrate the efficiency and robustness of the proposed algorithm in non-stationary dynamic pricing.
Harnessing Unimodality in Semiparametric Contextual Pricing via Oracle Price Map Learning
We study contextual dynamic pricing in a semiparametric scalar-index valuation model where the latent value is , with an unknown utility map and an unknown additive noise distribution. The key decision object is the one-dimensional oracle price map induced by the scalar index and the noise tail. Under the -Hölder smoothness of the tail function for and a revenue-geometry condition that gives a unique, stable, interior maximizer, this oracle map is itself -smooth. We exploit such structure through , a modular coarse-to-fine policy that takes a scalar pilot index as input, localizes a benchmark price in each active bin, and learns a local polynomial approximation of the oracle map inside a trust region via bandit convex optimization. For the baseline linear utility model , an adaptive elliptical exploration scheme constructs the required scalar pilot online without distributional assumptions on the contexts. The resulting policy achieves regret . For fixed , we establish a matching lower bound in the horizon dependence, unveiling that the nonparametric oracle-map learning term is minimax sharp. The same scalar-pilot interface also yields extensions to sparse high-dimensional linear utility and nonparametric Hölder utility.
Optimal Contextual Pricing under Agnostic Non-Lipschitz Demand
We study contextual dynamic pricing with linear valuations and bounded-support agnostic noise, whose induced demand curve may be non-Lipschitz with arbitrary jumps and atoms. Such discontinuities break the cross-context interpolation arguments used by smooth-demand pricing algorithms, while the best previous method achieved only regret. We propose Conservative-Markdown Redirect-UCB Pricing, a polynomial-time algorithm that combines randomized parameter estimation, conservative residual-grid probing, and confidence-based one-step redirection. Our algorithm achieves optimal regret, matching the known lower bounds of Kleinberg and Leighton (2003) up to logarithmic factors and improving over the previous upper bound of Xu and Wang (2022). Under stochastic well-conditioned contexts, this closes the long-existing open regret gap in linear-valuation contextual pricing under agnostic non-Lipschitz noise distribution.
Personalized Pricing with Invalid Instrumental Variables: Identification, Estimation, and Policy Learning
Pricing based on individual customer characteristics is widely used to maximize sellers' revenues. We study how a firm can learn such a personalized pricing policy from historical transactions when unobserved factors affect both the prices it charged and the revenue it earned. Standard instrumental variable (IV) methods either focus on a discrete treatment space or require that the IV affect revenue only through price. This exclusion restriction is difficult to justify in pricing, where the most natural candidate IVs are price-setting levers that may also affect revenue directly. We propose PRINT (Personalized pRicing using Invalid iNsTrumental variables), a policy learning method for continuous prices that uses such candidate IVs. Relying on structural models of revenue and price, we show that the optimal pricing policy can be identified with invalid IV that shifts higher moments of historical prices, when the unobserved factors that drive customers' price sensitivity are separated from those used by the historical pricing rule. Based on this identification, which leads to conditional moment restrictions with generalized residual functions, we construct an adversarial min-max estimator that accommodates flexible machine learning models and establish regret bounds for the learned pricing policy. Simulation studies and an application to a U.S. online auto lender illustrate the method's performance. Our results give a principled way to learn personalized prices from observational data using imperfect price-setting levers, and clarify when doing so is justified.