Optimal Reserve Price for Online Ads Trading Based on Inventory Identification
Zhihui Xie, Kuang-Chih Lee, Liang Wang

TL;DR
This paper presents a novel method for dynamically predicting optimal reserve prices in online ad auctions, focusing on high-value inventories to significantly boost seller revenue without disrupting existing models.
Contribution
The authors introduce a new inventory value identification approach using cascaded classifiers to improve reserve price setting in online ad auctions, a previously unexplored perspective.
Findings
Significant revenue lift achieved in simulations
Effective identification of high-value inventories
Compatibility with existing reserve price models
Abstract
The online ads trading platform plays a crucial role in connecting publishers and advertisers and generates tremendous value in facilitating the convenience of our lives. It has been evolving into a more and more complicated structure. In this paper, we consider the problem of maximizing the revenue for the seller side via utilizing proper reserve price for the auctions in a dynamical way. Predicting the optimal reserve price for each auction in the repeated auction marketplaces is a non-trivial problem. However, we were able to come up with an efficient method of improving the seller revenue by mainly focusing on adjusting the reserve price for those high-value inventories. Previously, no dedicated work has been performed from this perspective. Inspired by Paul and Michael, our model first identifies the value of the inventory by predicting the top bid price bucket using a cascade of…
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.
