stat.MLOct 31, 2026

Pricing Today, Shaping Tomorrow: Contextual Dynamic Pricing in Purchase-Driven Evolving Systems

Authors: Jinjiang Zou, Yang Li, Zemin Zheng

Organizations: School of Management, University of Science and Technology of China, Hefei 230026, China

Abstract

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 β≥2β\ge2. Numerical experiments further demonstrate the appealing performance of SHAPE.

Figures & tables

Explore similar work

Oct 29, 2026

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 VV. 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 O((TV+1)log⁡T)O((\sqrt{TV}+1)\log T). 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 O((d2+d3/2TV)log⁡2T)O((d^2+d^{3/2}\sqrt{TV})\log^2 T), where dd is the context dimension. For fixed dd, both guarantees match the lower bound Ω(TV+log⁡log⁡T)Ω(\sqrt{TV}+\log\log T) up to logarithmic factors in TT, establishing near-optimality among deterministic algorithms for every V∈[0,T]V\in[0,T], including the stationary case.
Aug 4, 2026

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.
Jul 27, 2026

On Non-Stationary Dynamic Pricing: Adaptivity and Optimality

We study the contextual dynamic pricing problem under non-stationarity, where a firm sells products to TT 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 Rd\mathbb{R}^d 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 O~(sTdT∧{VT1/3d1/3T2/3+dT})\widetilde{O}(\sqrt{s_TdT}\wedge\{V_T^{1/3}d^{1/3}T^{2/3}+\sqrt{dT}\}), where sTs_T is the number of piecewise stationary segments and VTV_T is a newly defined notion of design-adjusted variation budget of model parameters. Our algorithm is adaptive and does not require knowing sTs_T or VTV_T. 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.