loading...
AdWords and Generalized On-line Matching
Pittsburgh, Pennsylvania, USA October 23-October 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.1246th Annual IEEE Symposium on Foundat ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Aranyak Mehta, Aranyak Mehta
Amin Saberi, Amin Saberi
Umesh Vazirani, Umesh Vazirani
Vijay Vazirani, Vijay Vazirani

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.

Citation:
Aranyak Mehta, Amin Saberi, Umesh Vazirani, Vijay Vazirani, "AdWords and Generalized On-line Matching," focs, pp.264-273, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.