Bid optimization for broad match Ad auctions

WWW'09 - Proceedings of the 18th International World Wide Web Conference

Volumn , Issue , 2009, Pages 231-240

  Even Dar, Eyal ^a   Mirrokni, Vahab S ^a   Muthukrishnan, S ^a   Mansour, Yishay ^a   Nadav, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Ad auctions; Bid optimization; Optimal bidding; Sponsored search

Indexed keywords

ALGORITHMS; BUDGET CONTROL; COMMERCE; COMPUTATIONAL LINGUISTICS; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION; PROFITABILITY; QUERY LANGUAGES; WORLD WIDE WEB;

AD AUCTIONS; APPROXIMATION FACTOR; BID OPTIMIZATIONS; CONSTANT FACTOR APPROXIMATION; HARDNESS RESULT; LP FORMULATIONS; OPTIMAL BIDDING; OPTIMAL BIDDING STRATEGY; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; QUERY LANGUAGE MODEL; SPONSORED SEARCHES;

OPTIMIZATION;

EID: 77954944671     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1526709.1526741     Document Type: Conference Paper

References (24)

1. G. Aggarwal, A. Goel, and R. Motwani. Truthful auctions for pricing search keywords. ACM Conference on Electronic Commerce (EC), 2006.
2. S. Athey and G. Ellison. Position auctions with consumer search. Working Paper, Sept 2007.
3. C. Borgs, J. Chayes, O. Etesami, N. Immorlica, K. Jain, and M. Mahdian. Dynamics of bid optimization in online advertisement auctions. WWW 2007: 531-540.
4. C. Borgs, J. T. Chayes, N. Immorlica, M. Mahdian, and A. Saberi. Multi-unit auctions with budget-constrained bidders. ACM Conference on Electronic Commerce (EC), 2005
5. D. Chakrabarty, Y. Zhou, and R. Lukose. Budget constrained bidding in keyword auctions and online knapsack problems. 3rd Workshop on Sponsored Search Auctions (SSA), 2007.
6. B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second price auction selling billions of dollars worth of keywords. In Second workshop on sponsored search auctions, 2006.
7. U. Feige. A threshold of ln n for approximating set cover. Journal of ACM, 45(4):634-652, 1998.
8. J. Feldman, S. Muthukrishnan, M. Pál, and C. Stein. Budget optimization in search-based advertising auctions. ACM Conference on Electronic Commerce (EC), 2006.
9. D. Martin, J. Gehrke, and J. Halperin. Toward expressive and scalable sponsored search auctions. Proceedings of the 24th International Conference on Data Engineering, ICDE 2008.
10. A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. Adwords and generalized online matching. Journal of the ACM, 54, 2007.
11. S. Muthukrishnan, M. Pál, and Z. Svitkina. Stochastic models for budget optimization in search-based advertising. Proc. Workshop on Internet and Network Economics (WINE), 2007.
12. C. H. Papadimitriou and K. Steiglitz. Combinatorial optimization. Prentice Hall.
13. P. Rusmevichientong and D. Williamson. An adaptive algorithm for selecting profitable keywords for search-based advertising services. ACM Conference on Electronic Commerce 2006: 260-269.
14. M. Stoer and F. Wagner. A simple min-cut algorithm. Journal of the ACM, 44(4):585-591, July 1997.
15. M. Sviridenko. A note on maximizing a submodular set function subject to knapsack constraint. Operations Research Letters 32 (2004), 41-43.
16. H. Varian. Position auctions. International Journal of Industrial Organization 25(6):1163-1178, December 2007.
17. http://adcentercommunity.com/blogs/advertiser/archive/2008/04/07/ keyword-match-types.aspx.
18. http://adwords.google.com/support/bin/answer.py?answer=25148.
19. http://adwords.google.com/support/bin/answer.py?hl=en&answer=6100.
20. http://help.yahoo.com/l/us/yahoo/ysm/sps/start/overview-matchtypes.html.
21. https://adcenter.microsoft.com/Default.aspx.
22. https://clients.mamma.com/faq/bidsystem/faq-broad-matching.html.
23. http://sem.smallbusiness.yahoo.com/searchenginemarketing/index.php? &abr=2022403519.
24. Yahoo! search marketing advertiser workbook. http://us.i1.yimg.com/us. yimg.com/i/us/ysm/misc/pdf/eworkbook.pdf.