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.
Figures & tables
Figure 1: Regret V(π∗)−V(π) versus sample size n (log–log scale).
Pricing Policy
Oracle
Firm
PRINT
Kallus and Zhou (2018b)
Regression
Revenue ($1000)
1.1062
0.8318
0.8921
0.1452
0.0456
Table 1: Fitted-model revenue scores on the testing dataset.
Figure 2: Personalized Pricing distributions on the testing dataset.
Figure 3: Partial dependence plots of the pricing strategy learned by PRINT on important factors. All factors are centered at their means and scaled by their standard deviations. Histograms are distributions of the standardized factors and blue lines are the partial dependence of the recommended price on each factor.
Resource-constrained pricing controllers can make fixed-price inference impossible: the controller's resource state may remove the target price neighborhood from the feasible set, even when every realized action has a known positive density. We formalize this support-exclusion failure through a local non-identification result and a realized information clock. We then design a target-aware pricing controller that certifies feasible target bands and logs continuous local densities. Localized debiasing gives studentized intervals whose width is governed by this clock. The resulting regret--information accounting, stated up to pilot re-solving error, shows that cheap exploration can be insufficient for inference: polynomial target mass gives polynomial rates, while a pure 1/t target branch does not yield shrinking fixed-target intervals without additional local movement. Experiments show calibration in certified bands and diagnostic abstention when the resource state collapses target support.
Ruicheng Ao, Jiashuo Jiang, David Simchi-Levi
Institute for Data, Systems, and Society, Massachusetts Institute of Technology, Cambridge, MA 02139 · Department of Industrial Engineering and Decision Analytics, Hong Kong University of Science and Technology, Hong Kong · Department of Civil and Environmental Engineering and Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139
We study the pricing behavior of third-party platforms facing strategic agents. Assuming the platform is a revenue maximizer, it observes market features that generally affect demand. Since only transacted quantities and prices can be observed, this presents a general demand learning problem under confounding. Mathematically, we develop an algorithm with optimal regret of \TildeO(T∧σS−2). Our results reveal that supply-side noise fundamentally affects the learnability of demand, leading to a phase transition in regret. Technically, we show that non-i.i.d. actions can serve as instrumental variables for learning demand. We also propose a novel homeomorphic construction that allows us to establish estimation bounds without assuming star-shapedness, providing the first efficiency guarantee for learning demand with deep neural networks. Finally, we use simulations and offline counterfactuals from Talabat and Lyft data to illustrate the potential revenue implications of our approach.
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.
Xueping Gong, Zhuoluo Zhang, Zhaowei Miao +1
School of Management, Xiamen University · Department of Industrial Engineering and Decision Analytics, The Hong Kong University of Science and Technology