Loss Functions for Discrete Contextual Pricing with Observational Data
Not on the map. Why?
Abstract (arXiv)
We study a pricing setting where each customer is offered a contextualized price based on customer and/or product features. Often only historical sales data are available, so we observe whether a customer purchased a product at the price prescribed rather than the customer's true valuation. Such observational data are influenced by historical pricing policies, which introduce difficulties in evaluating the effectiveness of future policies. The goal of this paper is to formulate loss functions that can be used for evaluating pricing policies directly from observational data, rather than going through an intermediate demand estimation stage, which may suffer from bias. To achieve this, we adapt ideas from machine learning with corrupted labels, where we consider each observed purchase decision as a known probabilistic transformation of the customer's valuation. From this transformation, we derive a class of unbiased loss functions. Within this class, we identify minimum variance estimators and estimators robust to poor demand estimation. Furthermore, we show that for contextual pricing, estimators popular in the off-policy evaluation literature fall within this class of loss functions. We offer managerial insights into scenarios under which these estimators are effective.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 35 of its 129 references that are in the map. First posted on arXiv 18 Nov 2021.
Builds on
35 of 129 references.
References · 35
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2017Meta-learners for Estimating Heterogeneous Treatment Effects using Machine Learningcited by 475
- 2017Smart "Predict, then Optimize"cited by 332
- 2016Learning Representations for Counterfactual Inferencecited by 327
- 2015Doubly Robust Policy Evaluation and Optimizationcited by 158
- 2014From Predictive to Prescriptive Analyticscited by 142
- 2018Strong mixed-integer programming formulations for trained neural networkscited by 115
- 2018Confounding-Robust Policy Improvementcited by 73
- 2018Offline Multi-Action Policy Learning: Generalization and Optimizationcited by 64
- 2020Off-policy Bandits with Deficient Supportcited by 60
23 more
- 2016Dynamic Pricing in High-dimensionscited by 55
- 2017Balanced Policy Evaluation and Learningcited by 51
- 2015Residual Weighted Learning for Estimating Individualized Treatment Rulescited by 37
- 2021Human-AI Collaboration with Bandit Feedbackcited by 36
- 2016Dynamic Pricing with Demand Covariatescited by 30
- 2016Recursive Partitioning for Personalization using Observational Datacited by 28
- 2019Distributionally Robust Counterfactual Risk Minimizationcited by 26
- 2020Model Distillation for Revenue Optimization: Interpretable Personalized Pricingcited by 24
- 2019More Efficient Policy Learning via Optimal Retargetingcited by 23
- 2017Revenue Optimization with Approximate Bid Predictionscited by 21
- 2015The Sample Complexity of Auctions with Side Informationcited by 20
- 2020Fairness, Welfare, and Equity in Personalized Pricingcited by 17
- 2013Learning Theory and Algorithms for Revenue Optimization in Second-Price Auctions with Reservecited by 16
- 2018Interpretable Optimal Stoppingcited by 15
- 2017Counterfactual Learning from Bandit Feedback under Deterministic Logging: A Case Study in Statistical Machine Translationcited by 13
- 2019Balanced off-policy evaluation in general action spacescited by 11
- 2020Contextual Reserve Price Optimization in Auctions via Mixed-Integer Programmingcited by 6
- 2021Model-Free Assortment Pricing with Transaction Datacited by 6
- 2018Optimization over Continuous and Multi-dimensional Decisions with Observational Datacited by 5
- 2019Classifying Treatment Responders Under Causal Effect Monotonicitycited by 4
- 2016The Power and Limits of Predictive Approaches to Observational-Data-Driven Optimizationcited by 3
- 2019Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problemcited by 1
- 2021Bounds and Heuristics for Multi-Product Personalized Pricingcited by 1
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 3.
6 papers.
- 2022Probabilistic Conformal Prediction Using Conditional Random Samplescited by 47
- 2021Enhancing Counterfactual Classification via Self-Trainingcited by 5
- 2023Balanced Off-Policy Evaluation for Personalized Pricingcited by 5
- 2023Confounding-Robust Policy Improvement with Human-AI Teamscited by 4
- 2022Convex Surrogate Loss Functions for Contextual Pricing with Transaction Datacited by 1
- 2023Learning Prescriptive ReLU Networkscited by 1
- 2023Confounding-Robust Policy Improvement with Human-AI Teams13 Oct 2023
- 2023Learning Prescriptive ReLU Networks1 Jun 2023
- 2023Balanced Off-Policy Evaluation for Personalized Pricing24 Feb 2023
- 2022Probabilistic Conformal Prediction Using Conditional Random Samples14 Jun 2022
- 2022Convex Surrogate Loss Functions for Contextual Pricing with Transaction Data16 Feb 2022
- 2021Enhancing Counterfactual Classification via Self-Training8 Dec 2021