Interpretable Price Bounds Estimation with Shape Constraints in Price Optimization
- URL: http://arxiv.org/abs/2405.14909v2
- Date: Sun, 29 Sep 2024 10:39:58 GMT
- Title: Interpretable Price Bounds Estimation with Shape Constraints in Price Optimization
- Authors: Shunnosuke Ikeda, Naoki Nishimura, Shunji Umetani,
- Abstract summary: This study addresses the interpretable estimation of price bounds in the context of price optimization.
We first estimate 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:
- Abstract: This study addresses the interpretable estimation of price bounds in the context of price optimization. In recent years, price-optimization methods have become indispensable for maximizing revenue and profits. However, effective application of these methods to real-world pricing operations remains a significant challenge. It is crucial for operators 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 reasonable determinations of these bounds. Therefore, we propose a comprehensive framework for determining price bounds that includes both the estimation and adjustment of these bounds. Specifically, we first estimate price bounds using three distinct approaches based on historical pricing data. Then, we adjust the estimated price bounds by solving an optimization problem that incorporates shape constraints. This method allows 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 using historical pricing data from actual services.
Related papers
- A Tale of Two Cities: Pessimism and Opportunism in Offline Dynamic Pricing [20.06425698412548]
This paper studies offline dynamic pricing without data coverage assumption.
We establish a partial identification bound for the demand parameter whose associated price is unobserved.
We incorporate pessimistic and opportunistic strategies within the proposed partial identification framework to derive the estimated policy.
arXiv Detail & Related papers (2024-11-12T19:09:41Z) - Cost-Control in Display Advertising: Theory vs Practice [0.2574913881702984]
In display advertising, advertisers want to achieve a marketing objective with constraints on budget and cost-per-outcome.
This is usually formulated as an optimization problem that maximizes the total utility under constraints.
The optimization is carried out in an online fashion in the dual space - for an incoming Ad auction, a bid is placed using an optimal bidding formula. based on the outcome of the previous auctions, the dual variables are updated in an online fashion.
While this approach is theoretically sound, in practice, the dual variables are not optimal from the beginning, but rather converge over time.
arXiv Detail & Related papers (2024-09-05T19:22:33Z) - 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) - Cost-aware Bayesian Optimization via the Pandora's Box Gittins Index [57.045952766988925]
We develop a previously-unexplored connection between cost-aware Bayesian optimization and the Pandora's Box problem, a decision problem from economics.
Our work constitutes a first step towards integrating techniques from Gittins index theory into Bayesian optimization.
arXiv Detail & Related papers (2024-06-28T17:20:13Z) - 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) - 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) - 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) - Hierarchical Adaptive Contextual Bandits for Resource Constraint based
Recommendation [49.69139684065241]
Contextual multi-armed bandit (MAB) achieves cutting-edge performance on a variety of problems.
In this paper, we propose a hierarchical adaptive contextual bandit method (HATCH) to conduct the policy learning of contextual bandits with a budget constraint.
arXiv Detail & Related papers (2020-04-02T17:04:52Z)
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.