Auctioning Keywords in Online Search
1Jianqing Chen is Assistant Professor in Information Systems, Haskayne School of Business, University of Calgary.
jiachen@ucalgary.caDe Liu, 2
2De Liu is Assistant Professor of Information Systems, Carol M. Gatton College of Business and Economics, University of Kentucky.
de.liu@uky.eduAndrew B. Whinston3
3Andrew B. Whinston is Hugh Cullen Chair Professor in Business Administration, McCombs School of Business, University of Texas at Austin.
abw@uts.cc.utexas.eduAbstract
Keyword advertising, or “sponsored links” that appear alongside online search results or other online content, has grown into a multibillion-dollar market. Providers of keyword advertising, such as Google and Yahoo, profit by auctioning keywords to advertisers. An issue of increasing importance for advertising providers is the “share structure” problem—that is, of the total available resources for each keyword (in terms of exposure), how large a share should be set aside for the highest bidder, for the second-highest bidder, and so on. The authors study this problem under a general specification and characterize the optimal share structures that maximize advertising providers' revenues. They also derive results on how the optimal share structure should change with advertisers' price elasticity of demand for exposure, their valuation distribution, total resources, and minimum bids. The authors draw implications for keyword auctions and other applications.
Cited by
Online publication date: 1-Apr-2012.
CrossRef
Online publication date: 1-Dec-2011.
CrossRef
Online publication date: 1-Aug-2011.
CrossRef
Online publication date: 1-Aug-2011.
CrossRef
Online publication date: 1-Jan-2011.
CrossRef
Online publication date: 1-Sep-2010.
CrossRef
Online publication date: 5-May-2010.
CrossRef
Online publication date: 1-Jan-2010.
CrossRef
