AdWords and Generalized On-line Matching

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.

[1]  Robert J. McEliece,et al.  New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities , 1977, IEEE Trans. Inf. Theory.

[2]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  V. Crawford,et al.  Job Matching with Heterogeneous Firms and Workers , 1981 .

[4]  D. Gale,et al.  Multi-Item Auctions , 1986, Journal of Political Economy.

[5]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[6]  Bala Kalyanasundaram,et al.  On-line Network Optimization Problems , 1996, Online Algorithms.

[7]  Yoav Freund,et al.  Game theory, on-line prediction and boosting , 1996, COLT '96.

[8]  Jon M. Kleinberg,et al.  An improved approximation ratio for the minimum latency problem , 1996, SODA '96.

[9]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[10]  Bala Kalyanasundaram,et al.  An optimal deterministic algorithm for online b-matching , 1996, Theor. Comput. Sci..

[11]  Evangelos Markakis,et al.  A Greedy Facility Location Algorithm Analyzed Using Dual Fitting , 2001, RANDOM-APPROX.

[12]  Amin Saberi,et al.  A new greedy approach for facility location problems , 2002, STOC '02.

[13]  Evangelos Markakis,et al.  Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP , 2002, JACM.

[14]  Baruch Schieber,et al.  Further Improvements in Competitive Guarantees for QoS Buffering , 2004, ICALP.

[15]  Yishay Mansour,et al.  Auctions with Budget Constraints , 2004, SWAT.

[16]  Yossi Azar,et al.  Maximizing throughput in multi-queue switches , 2004, Algorithmica.

[17]  Nicole Immorlica,et al.  Click Fraud Resistant Methods for Learning Click-Through Rates , 2005, WINE.

[18]  Nicole Immorlica,et al.  Multi-unit auctions with budget-constrained bidders , 2005, EC '05.

[19]  Ashish Goel,et al.  Truthful auctions for pricing search keywords , 2006, EC '06.

[20]  Daniel Lehmann,et al.  Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.

[21]  Paramvir Bahl,et al.  Cell Breathing in Wireless LANs: Algorithms and Evaluation , 2007, IEEE Transactions on Mobile Computing.

[22]  Amin Saberi,et al.  Allocating online advertisement space with unreliable estimates , 2007, EC '07.