Abstract
We study how standard auction objectives in sponsored search markets are affected by refinement in the prediction of ad relevance (click-through rates). As the prediction algorithm takes more features into account, its predictions become more refined; a natural question is whether this is desirable from the perspective of auction objectives. Our focus is on mechanisms that optimize for a convex combination of efficiency and revenue, and our starting point is the observation that the objective of such a mechanism can only improve with refined prediction, making refinement in the best interest of the search engine. We demonstrate that the impact of refinement on market efficiency is not always positive; nevertheless we are able to identify natural – and to some extent necessary – conditions under which refinement is guaranteed to also improve efficiency. Our main technical contribution is in explaining how refinement changes the ranking of advertisers by value (efficiency-ranking), moving it either towards or away from their ranking by virtual value (revenue-ranking). These results are closely related to the literature on signaling in auctions.
| Original language | English |
|---|---|
| Pages (from-to) | 267-278 |
| Number of pages | 12 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 8768 |
| DOIs | |
| State | Published - 2014 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- General Computer Science