The Community for Technology Leaders
RSS Icon
Subscribe
Pittsburgh, Pennsylvania, USA
Oct. 23, 2005 to Oct. 25, 2005
ISBN: 0-7695-2468-0
pp: 264-273
Aranyak Mehta , Aranyak Mehta
Amin Saberi , Amin Saberi
Umesh Vazirani , Umesh Vazirani
Vijay Vazirani , Vijay Vazirani
ABSTRACT
<p>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.</p>
INDEX TERMS
null
CITATION
Aranyak Mehta, Amin Saberi, Umesh Vazirani, Vijay Vazirani, "AdWords and Generalized On-line Matching", FOCS, 2005, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science 2005, pp. 264-273, doi:10.1109/SFCS.2005.12
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool