Proceedings ArticleDOI
AdWords and generalized on-line matching
Aranyak Mehta,Amin Saberi,Umesh Vazirani,Vijay V. Vazirani +3 more
- pp 264-273
Reads0
Chats0
TLDR
The notion of a tradeoff revealing LP is introduced and used to derive two optimal algorithms achieving competitive ratios of 1-1/e for this problem of online bipartite matching.Abstract:
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching problem. We introduce the notion of a tradeoff revealing LP and use it to derive two optimal algorithms achieving competitive ratios of 1-1/e for this problem.read more
Citations
More filters
Book
Algorithmic Game Theory
TL;DR: A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior in a bid to solve the challenges of 21st Century finance.
Book
Mining of Massive Datasets
TL;DR: This book focuses on practical algorithms that have been used to solve key problems in data mining and which can be used on even the largest datasets, and explains the tricks of locality-sensitive hashing and stream processing algorithms for mining data that arrives too fast for exhaustive processing.
Journal ArticleDOI
Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords
TL;DR: In this article, the authors investigate the generalized second-price (GSP) auction, a new mechanism used by search engines to sell online advertising, and show that it has a unique equilibrium, with the same payoffs to all players as the dominant strategy equilibrium of VCG.
Journal ArticleDOI
AdWords and generalized online matching
TL;DR: The notion of a tradeoff revealing LP is introduced and used to derive two optimal algorithms achieving competitive ratios of 1-1/e for this problem of online bipartite matching.
Book ChapterDOI
Online primal-dual algorithms for maximizing ad-auctions revenue
TL;DR: A (1 - 1/e)-competitive (optimal) algorithm is designed for the online ad-auctions problem, which is based on a clean primal-dual approach, matching the competitive factor obtained in Mehta et al.
References
More filters
Proceedings ArticleDOI
Probabilistic computations: Toward a unified measure of complexity
TL;DR: Two approaches to the study of expected running time of algoritruns lead naturally to two different definitions of intrinsic complexity of a problem, which are the distributional complexity and the randomized complexity, respectively.
Proceedings ArticleDOI
An optimal algorithm for on-line bipartite matching
TL;DR: This work applies the general approach to data structures, bin packing, graph coloring, and graph coloring to bipartite matching and shows that a simple randomized on-line algorithm achieves the best possible performance.
Journal ArticleDOI
Multi-Item Auctions
TL;DR: In this paper, a collection of items is to be distributed among several bidders, and each bidder is to receive at most one item, and it has been shown that there is a unique vector of equilibrium prices that is optimal, in a suitable sense, for the bidderers.
Posted Content
Multi-Item Auctions
TL;DR: In this paper, a collection of items is to be distributed among several bidders, and each bidder is to receive at most one item, and it has been shown that there is a unique vector of equilibrium prices that is optimal, in a suitable sense, for the bidderers.
Journal ArticleDOI
Job Matching with Heterogeneous Firms and Workers
Related Papers (5)
Online budgeted matching in random input models with applications to Adwords
Gagan Goel,Aranyak Mehta +1 more