Interpretable Price Bounds Estimation with Shape Constraints in Price Optimization
- URL: http://arxiv.org/abs/2405.14909v1
- Date: Thu, 23 May 2024 10:30:16 GMT
- Title: Interpretable Price Bounds Estimation with Shape Constraints in Price Optimization
- Authors: Shunnosuke Ikeda, Naoki Nishimura, Shunji Umetani,
- Abstract summary: This paper addresses the interpretable estimation of price bounds within the context of price optimization.
We first estimate the price bounds using three distinct approaches based on historical pricing data.
We then adjust the estimated price bounds by solving an optimization problem that incorporates shape constraints.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper addresses the interpretable estimation of price bounds within the context of price optimization. In recent years, price optimization methods have become indispensable for maximizing revenues and profits. However, effectively applying these methods to real-world pricing operations remains a significant challenge. It is crucial for operators, who are responsible for setting prices, to utilize reasonable price bounds that are not only interpretable but also acceptable. Despite this necessity, most studies assume that price bounds are given constant values, and few have explored the reasonable determination of these bounds. In response, we propose a comprehensive framework for determining price bounds, which includes both the estimation and adjustment of these bounds. Specifically, we first estimate the price bounds using three distinct approaches based on historical pricing data. We then adjust the estimated price bounds by solving an optimization problem that incorporates shape constraints. This method allows for the implementation of price optimization under practical and reasonable price bounds, suitable for real-world applications. We report the effectiveness of our proposed method through numerical experiments conducted with historical pricing data from actual services.
Related papers
- A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
We address the problem of dynamically pricing complementary items that are sequentially displayed to customers.
Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective.
We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
arXiv Detail & Related papers (2024-07-08T09:55:31Z) - Minimax Optimality in Contextual Dynamic Pricing with General Valuation Models [4.156757591117864]
We propose a novel algorithm that achieves improved regret bounds while minimizing assumptions about the problem.
Our method extends beyond linear valuation models commonly used in dynamic pricing by considering general function spaces.
arXiv Detail & Related papers (2024-06-24T23:43:56Z) - Optimal Baseline Corrections for Off-Policy Contextual Bandits [61.740094604552475]
We aim to learn decision policies that optimize an unbiased offline estimate of an online reward metric.
We propose a single framework built on their equivalence in learning scenarios.
Our framework enables us to characterize the variance-optimal unbiased estimator and provide a closed-form solution for it.
arXiv Detail & Related papers (2024-05-09T12:52:22Z) - Causal Forecasting for Pricing [7.077353694086149]
This paper proposes a novel method for demand forecasting in a pricing context.
Our methods bring together the Double Machine Learning methodology for causal inference and state-of-the-art transformer-based forecasting models.
arXiv Detail & Related papers (2023-12-23T15:38:22Z) - Rate-Optimal Policy Optimization for Linear Markov Decision Processes [65.5958446762678]
We obtain rate-optimal $widetilde O (sqrt K)$ regret where $K$ denotes the number of episodes.
Our work is the first to establish the optimal (w.r.t.$K$) rate of convergence in the setting with bandit feedback.
No algorithm with an optimal rate guarantee is currently known.
arXiv Detail & Related papers (2023-08-28T15:16:09Z) - Balanced Off-Policy Evaluation for Personalized Pricing [3.296526804364952]
We consider a personalized pricing problem in which we have data consisting of feature information, historical pricing decisions, and binary realized demand.
The goal is to perform off-policy evaluation for a new personalized pricing policy that maps features to prices.
Building on the balanced policy evaluation framework of Kallus, we propose a new approach tailored to pricing applications.
arXiv Detail & Related papers (2023-02-24T16:44:46Z) - Personalized Pricing with Invalid Instrumental Variables:
Identification, Estimation, and Policy Learning [5.372349090093469]
This work studies offline personalized pricing under endogeneity using an instrumental variable approach.
We propose a new policy learning method for Personalized pRicing using Invalid iNsTrumental variables.
arXiv Detail & Related papers (2023-02-24T14:50:47Z) - COptiDICE: Offline Constrained Reinforcement Learning via Stationary
Distribution Correction Estimation [73.17078343706909]
offline constrained reinforcement learning (RL) problem, in which the agent aims to compute a policy that maximizes expected return while satisfying given cost constraints, learning only from a pre-collected dataset.
We present an offline constrained RL algorithm that optimize the policy in the space of the stationary distribution.
Our algorithm, COptiDICE, directly estimates the stationary distribution corrections of the optimal policy with respect to returns, while constraining the cost upper bound, with the goal of yielding a cost-conservative policy for actual constraint satisfaction.
arXiv Detail & Related papers (2022-04-19T15:55:47Z) - Convex Loss Functions for Contextual Pricing with Observational
Posted-Price Data [2.538209532048867]
We study an off-policy contextual pricing problem where the seller has access to samples of prices which customers were previously offered.
This is in contrast to the well-studied setting in which samples of the customer's valuation (willingness to pay) are observed.
In our setting, the observed data is influenced by the historic pricing policy, and we do not know how customers would have responded to alternative prices.
arXiv Detail & Related papers (2022-02-16T22:35:39Z) - Low-Cost Algorithmic Recourse for Users With Uncertain Cost Functions [74.00030431081751]
We formalize the notion of user-specific cost functions and introduce a new method for identifying actionable recourses for users.
Our method satisfies up to 25.89 percentage points more users compared to strong baseline methods.
arXiv Detail & Related papers (2021-11-01T19:49:35Z) - Fairness, Welfare, and Equity in Personalized Pricing [88.9134799076718]
We study the interplay of fairness, welfare, and equity considerations in personalized pricing based on customer features.
We show the potential benefits of personalized pricing in two settings: pricing subsidies for an elective vaccine, and the effects of personalized interest rates on downstream outcomes in microcredit.
arXiv Detail & Related papers (2020-12-21T01:01:56Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.