The Community for Technology Leaders
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) (2005)
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

A. Mehta, U. Vazirani, V. Vazirani and A. Saberi, "AdWords and Generalized On-line Matching," 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)(FOCS), Pittsburgh, Pennsylvania, USA, 2005, pp. 264-273.
doi:10.1109/SFCS.2005.12
89 ms
(Ver 3.3 (11022016))