Algorithmic Methods for Sponsored Search Advertising
Jon Feldman, S. Muthukrishnan

TL;DR
This paper provides an overview of auction-based mechanisms in sponsored search advertising, discussing the game-theoretic aspects, algorithms, and challenges involved in optimizing ad placement and pricing.
Contribution
It offers a comprehensive review of current auction systems, game-theoretic models, and mathematical techniques used in sponsored search advertising, highlighting future research directions.
Findings
Analysis of auction mechanisms and their game-theoretic properties
Discussion of algorithms based on mechanism design, optimization, and statistical estimation
Identification of key challenges in sponsored search advertising
Abstract
Modern commercial Internet search engines display advertisements along side the search results in response to user queries. Such sponsored search relies on market mechanisms to elicit prices for these advertisements, making use of an auction among advertisers who bid in order to have their ads shown for specific keywords. We present an overview of the current systems for such auctions and also describe the underlying game-theoretic aspects. The game involves three parties--advertisers, the search engine, and search users--and we present example research directions that emphasize the role of each. The algorithms for bidding and pricing in these games use techniques from three mathematical areas: mechanism design, optimization, and statistical estimation. Finally, we present some challenges in sponsored search advertising.
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 · Digital Platforms and Economics
