Optimization of Nonrecursive Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Truthful Mechanisms for One-Parameter Agents
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Truthful auctions for pricing search keywords
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
An experimental comparison of click position-bias models
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Online budgeted matching in random input models with applications to Adwords
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Cascade Model for Externalities in Sponsored Search
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Sponsored Search Auctions with Reserve Prices: Going Beyond Separability
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On the Equilibria and Efficiency of the GSP Mechanism in Keyword Auctions with Externalities
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Computational analysis of perfect-information position auctions
Proceedings of the 10th ACM conference on Electronic commerce
Externalities in Keyword Auctions: An Empirical and Theoretical Assessment
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
A New Ranking Scheme of the GSP Mechanism with Markovian Users
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Bayesian Browsing Model: Exact Inference of Document Relevance from Petabyte-Scale Data
ACM Transactions on Knowledge Discovery from Data (TKDD)
Mathematical modeling of competition in sponsored search market
Proceedings of the 2010 Workshop on Economics of Networks, Systems, and Computation
Optimizing two-dimensional search results presentation
Proceedings of the fourth ACM international conference on Web search and data mining
Optimal auctions with positive network externalities
Proceedings of the 12th ACM conference on Electronic commerce
Money for nothing: exploiting negative externalities
Proceedings of the 12th ACM conference on Electronic commerce
Externalities among advertisers in sponsored search
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Computing optimal outcomes under an expressive representation of settings with externalities
Journal of Computer and System Sciences
Sponsored search auctions with conflict constraints
Proceedings of the fifth ACM international conference on Web search and data mining
On revenue in the generalized second price auction
Proceedings of the 21st international conference on World Wide Web
A truthful learning mechanism for contextual multi-slot sponsored search auctions with externalities
Proceedings of the 13th ACM Conference on Electronic Commerce
Revenue estimation and quantification in sponsored search auctions: an inductive learning approach
ICDEM'10 Proceedings of the Second international conference on Data Engineering and Management
A truthful learning mechanism for multi-slot sponsored search auctions with externalities
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Sponsored search auctions: an overview of research with emphasis on game theoretic aspects
Electronic Commerce Research
Budget optimization for online campaigns with positive carryover effects
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Ad allocation for browse sessions
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Optimal Auctions with Positive Network Externalities
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
Which mechanism for sponsored search auctions with externalities?
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Competitive auctions for markets with positive externalities
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Impression fraud in online advertising via pay-per-view networks
SEC'13 Proceedings of the 22nd USENIX conference on Security
User satisfaction in competitive sponsored search
Proceedings of the 23rd international conference on World wide web
Proceedings of the 23rd international conference on World wide web
Hi-index | 0.00 |
Sponsored search involves running an auction among advertisers who bid in order to have their ad shown next to search results for specific keywords. The most popular auction for sponsored search is the "Generalized Second Price" (GSP) auction where advertisers are assigned to slots in the decreasing order of their score , which is defined as the product of their bid and click-through rate. One of the main advantages of this simple ranking is that bidding strategy is intuitive: to move up to a more prominent slot on the results page, bid more. This makes it simple for advertisers to strategize. However this ranking only maximizes efficiency under the assumption that the probability of a user clicking on an ad is independent of the other ads shown on the page. We study a Markovian user model that does not make this assumption. Under this model, the most efficient assignment is no longer a simple ranking function as in GSP. We show that the optimal assignment can be found efficiently (even in near-linear time). As a result of the more sophisticated structure of the optimal assignment, bidding dynamics become more complex: indeed it is no longer clear that bidding more moves one higher on the page. Our main technical result is that despite the added complexity of the bidding dynamics, the optimal assignment has the property that ad position is still monotone in bid. Thus even in this richer user model, our mechanism retains the core bidding dynamics of the GSP auction that make it useful for advertisers.