Sponsored search auctions

Algorithmic Game Theory

Volumn 9780521872829, Issue , 2007, Pages 699-716

  Lahaie, SÉbastien ^a   Pennock, David M ^b   Saberi, Amin ^c   Vohra, Rakesh V ^d  

^a HARVARD UNIVERSITY   (United States)

^b Yahoo! Research New York   (United States)

^c Stanford University   (United States)

^d NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; HYPERTEXT SYSTEMS; INFORMATION RETRIEVAL; SEARCH ENGINES; WEBSITES;

BEST BUIES; HYPERLINKS; OFFLINE; SPONSORED RESULTS; SPONSORED SEARCH AUCTIONS; SPONSORED SEARCHES;

MARKETING;

EID: 84926096782     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511800481.030     Document Type: Chapter

References (33)

1. Z. Abrams. Revenue maximization when bidders have budgets. In Proc. Symp. on Discrete Algorithms, Miami, FL, 2006.
2. G. Aggarwal, A. Goel, and R. Motwani. Truthful auctions for pricing search keywords. In Proc. 7th ACM Conf. on Electronic Commerce, Ann Arbor, MI, 2006.
3. K. Asdemir. Bidding patterns in search engine auctions. In Proc. 2nd Workshop on Sponsored Search Auctions, Ann Arbor, MI, 2006.
4. H.K. Bhargava and J. Feng. Preferential placement in internet search engines. In Proc. 11th World Wide Web Conf., Honolulu, HI, 2002.
5. C. Borgs, J. Chayes, O. Etesami, N. Immorlica, K. Jain, and M. Mahdian. Bid optimization in online advertisement auctions. Preprint, 2005.
6. C. Borgs, J. Chayes, N. Immorlica, M. Mahdian, and A. Saberi. Multi-unit auctions with budgetconstrained bidders. In Proc. 6th Conf. Electronic Commerce, Vancouver, British Columbia, Canada, 2005.
7. N. Buchbinder, K. Jain, and J. Naor. Online primal-dual algorithms for maximizing ad-auctions revenue. Preprint, 2006.
8. R. Burguet. The condominium problem; auctions for substitutes. Rev. Econ. Design, 9, 2005.
9. M. Cary, A. Das, B. Edelman, I. Giotis, K. Heimerl, A. Karlin, C. Mathieu, and M. Schwarz. Greedy bidding strategies for keyword auctions. Preprint, 2007.
10. V.P. Crawford and E.M. Knoer. Job matching with heterogeneous firms and workers. Econometrica, 49(2):437–450, 1981.
11. G. Demange, D. Gale, and M. Sotomayor. Multi-item auctions. J. Political Econ., 94(4):863–872, 1986.
12. B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the Generalized Second Price auction: Selling billions of dollars worth of keywords. Amer. Econ. Review, In press.
13. J. Feng. Optimal mechanism for selling a set of commonly ranked objects. Working paper, University of Florida, February 2005.
14. J. Feng, H.K. Bhargava, and D.M. Pennock. Implementing sponsored search in Web search engines: Computational evaluation of alternative mechanisms. INFORMS J. Computing, 2006, In press.
15. R. Gonen and E. Pavlov. An incentive compatible multi armed bandit mechanism. Preprint, 2007.
16. D.L. Hoffman and T.P. Novak. How to acquire customers on the Web. Harv. Busin. Rev., 78(3), May–June 2000.
17. Y.J. Hu. Performance-based pricing models in online advertising. Technical report, Sloan School of Management, MIT, 2003.
18. G. Iyengar and A. Kumar. Characterizing optimal keyword auctions. In Proc. 2nd Workshop on Sponsored Search Auctions, Ann Arbor, MI, 2006.
19. B. Kalyanasundaram and K.R. Pruhs. An optimal deterministic algorithm for online b-matching. Theor. Comp. Sci., 233(1–2):319–325, 2000.
20. R. Karp, U. Vazirani, and V. Vazirani. An optimal algorithm for online bipartite matching. In Proc. 22nd Symp. Theory of Computing, Baltimore, MD, 1990.
21. B. Kitts, P. Laxminarayan, B. LeBlanc, and R. Meech. A formal analysis of search auctions including predictions on click fraud and bidding tactics. In Proc. 1stWorkshop on Sponsored Search Auctions at the ACM Conf. on Electronic Commerce, Vancouver, British Columbia, Canada, 2005.
22. B. Kitts and B. LeBlanc. Optimal bidding on keyword auctions. Electronic Markets, 14(3):186–201, 2004.
23. S. Lahaie. An analysis of alternative slot auction designs for sponsored search. In Proc. 7th Conf. on Electronic Commerce, Ann Arbor, MI, 2006.
24. M. Mahdian, H. Nazerzadeh, and A. Saberi. Allocating online advertisement space with unreliable estimates. In Proc. 8th ACM Conf. on Electronic Commerce, San Diego, CA, 2007.
25. M. Mahdian and A. Saberi. Multiunit auctions with unknown supply. In Proc. 7th ACM Conf. on Electronic Commerce, Ann Arbor, MI, 2006.
26. A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. AdWords and generalized on-line matching. In Proc. 46th Annual Symp. on Fdns. of Comp. Sci., 2005.
27. G. Monge. Sur la théorie des déblais et des remblais. Mémoires de l’académie de Paris, 1781.
28. S. Pandey and C. Olston. Handling advertisements of unknown quality in search advertising. In Neural Information Processing Systems, 2006.
29. E. Rolland and R.A. Patterson. Classification in online pay-for-performance advertising. In Proc. 13th Annual Workshop On Information Technologies and Systems, Seattle, WA, 2003.
30. P. Rusmevichientong and D.P. Williamson. An adaptive algorithm for selecting profitable keywords for search-based advertising services. In Proc. 7th ACM Conf. on Electronic Commerce, pp. 260–269, Ann Arbor, MI, 2006.
31. H.R. Varian. Position auctions. Intl. J. Industrial Organization, in press.
32. T.A. Weber and Z. Zheng. A model of search intermediaries and paid referrals. OPIM Working Paper 02-12-01, Wharton School, April 2002.
33. Y. Zhou and R. Lukose. Vindictive bidding in keyword auctions. In Proc. 2ndWorkshop on Sponsored Search Auctions, Ann Arbor, MI, 2006.