An Adaptive Online Ad Auction Scoring Algorithm for Revenue Maximization
Chenyang Li, Mingyi Hong, Randy Cogill, Alfredo Garcia

TL;DR
This paper proposes an adaptive online scoring algorithm for ad auctions aimed at maximizing revenue by dynamically adjusting to bidding behaviors in sponsored search platforms.
Contribution
It introduces a novel adaptive scoring algorithm that improves revenue outcomes in online ad auctions compared to traditional static methods.
Findings
Enhanced revenue through adaptive scoring
Improved allocation efficiency in ad auctions
Robustness to bid fluctuations
Abstract
Sponsored search becomes an easy platform to match potential consumers' intent with merchants' advertising. Advertisers express their willingness to pay for each keyword in terms of bids to the search engine. When a user's query matches the keyword, the search engine evaluates the bids and allocates slots to the advertisers that are displayed along side the unpaid algorithmic search results. The advertiser only pays the search engine when its ad is clicked by the user and the price-per-click is determined by the bids of other competing advertisers.
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 · Optimization and Search Problems
