Bounds and Heuristics for Multi-Product Personalized Pricing
Guillermo Gallego, Gerardo Berbeglia

TL;DR
This paper develops bounds and heuristics for multi-product personalized pricing, providing guarantees on profit performance relative to optimal pricing and introducing clustering methods to improve practical outcomes.
Contribution
It introduces tight bounds and robust heuristics for personalized multi-product pricing, including clustering strategies and performance guarantees for various pricing schemes.
Findings
Robust factor achieves optimal performance guarantees.
Clustering heuristics improve pricing performance.
Machine learning clustering outperforms worst-case methods.
Abstract
We present tight bounds and heuristics for personalized, multi-product pricing problems. Under mild conditions we show that the best price in the direction of a positive vector results in profits that are guaranteed to be at least as large as a fraction of the profits from optimal personalized pricing. For unconstrained problems, the fraction depends on the factor and on optimal price vectors for the different customer types. For constrained problems the factor depends on the factor and a ratio of the constraints. Using a factor vector with equal components results in uniform pricing and has exceedingly mild sufficient conditions for the bound to hold. A robust factor is presented that achieves the best possible performance guarantee. As an application, our model yields a tight lower-bound on the performance of linear pricing relative to optimal personalized non-linear pricing, and…
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.
