Estimating profitable price bounds for prescriptive price optimization
Masato Inokuma, Shunnosuke Ikeda, Yuichi Takano

TL;DR
This paper introduces two novel methods for estimating profitable price bounds in prescriptive price optimization, improving revenue outcomes by balancing price range width and reliability, especially with limited or noisy data.
Contribution
It proposes bootstrap-based and Nelder--Mead optimization methods for accurately estimating price bounds that maximize revenue in prescriptive pricing models.
Findings
Methods effectively narrow price ranges while maintaining high revenue.
Performance improves with more data and lower demand noise.
Approaches are especially beneficial for small item sets.
Abstract
Pricing of products and services, which has a significant impact on consumer demand, is one of the most important factors in maximizing business profits. Prescriptive price optimization is a prominent data-driven pricing methodology consisting of two phases: demand forecasting and price optimization. In the practice of prescriptive price optimization, the price of each item is typically set within a predetermined range defined by lower and upper bounds. Narrow price ranges can lead to missed opportunities, while wide price ranges run the risk of proposing unrealistic prices; therefore, determining profitable price bounds while maintaining the reliability of the suggested prices is a critical challenge that directly affects the effectiveness of prescriptive price optimization. We propose two methods for estimating price bounds in prescriptive price optimization so that future total…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConsumer Market Behavior and Pricing · Auction Theory and Applications · Advanced Bandit Algorithms Research
