Ex Ante Information and the Design of Keyword Auctions

Published Online:https://doi.org/10.1287/isre.1080.0225

References

  • Armstrong M. Optimal multi-object auctions. Rev. Econom. Stud. (2000) 67(3):455–481CrossrefGoogle Scholar
  • Asker J. W., Cantillon E. Properties of scoring auctions. RAND J. Econom. (2008) 39(1):69–85CrossrefGoogle Scholar
  • Bapna R., Goes P., Gupta A. Pricing and allocation for quality differentiated online services. Management Sci. (2005) 51(7):1141–1150LinkGoogle Scholar
  • Beall S., Carter C., Carter P. L., Germer T., Hendrick T., Jap S., Kaufmann L., et al. The role of reverse auctions in strategic sourcing. (2003) . CAPS Research Report, Tempe, AZGoogle Scholar
  • Che Y.-K. Design competition through multidimensional auctions. RAND J. Econom. (1993) 24(4):668–680CrossrefGoogle Scholar
  • Edelman B., Ostrovsky M., Schwarz M. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. Amer. Econom. Rev. (2007) 97(1):242–259CrossrefGoogle Scholar
  • eMarketer Online advertising on a rocket ride. eMarketer Reports (2007) November 7):1–2Google Scholar
  • Ewerhart C., Fieseler K. Procurement auctions and unit-price contracts. RAND J. Econom. (2003) 34(3):569–581CrossrefGoogle Scholar
  • Feng J. Optimal allocation mechanisms when bidders ranking for the objects is common. Marketing Sci. (2007) . ForthcomingGoogle Scholar
  • Google (2006) . Accessed September 26, 2009, http://adwords.blogspot.com/2006/11/landing-page-quality-update.htmlGoogle Scholar
  • Hosanagar K., Krishnan R., Chuang J., et al. Pricing and resource allocation in caching services with multiple levels of quality of service. Management Sci. (2005) 51(12):1844–1859LinkGoogle Scholar
  • Interactive Advertising Bureau and PricewaterhouseCoopers Internet advertising revenues again reach new highs, estimated to pass $21 billion in 2007 and hit nearly $6 billion in Q4 2007. (2008) . Report, Interactive Advertising Bureau and PricewaterhouseCoopers, New YorkGoogle Scholar
  • Krishna V.Auction Theory (2002) (Academic Press, San Diego) Google Scholar
  • Lahaie S. An analysis of alternative slot auction designs for sponsored search. Proc. 7th ACM Conf. Electronic Commerce (2006) (ACM Press, Ann Arbor, MI) 218–227CrossrefGoogle Scholar
  • Liu D., Chen J. Designing online auctions with performance information. Decision Support Systems (2006) 42(3):1307–1320CrossrefGoogle Scholar
  • McAfee R. P., McMillan J. Bidding for contracts—A principal-agent analysis. RAND J. Econom. (1986) 17(3):326–338CrossrefGoogle Scholar
  • McAfee R. P., McMillan J. Auctions and bidding. J. Econom. Literature (1987) 25(2):699–738Google Scholar
  • Myerson R. B. Optimal auction design. Math. Oper. Res. (1981) 6(1):58–73LinkGoogle Scholar
  • Pinker E. J., Seidmann A., Vakrat Y. Managing online auctions: Current business and research issues. Management Sci. (2003) 49(11):1457–1484LinkGoogle Scholar
  • Riley J. G. Ex post information in auctions. Rev. Econom. Stud. (1988) 55(3):409–429CrossrefGoogle Scholar
  • Samuelson W. Bidding for contracts. Management Sci. (1986) 32(12):1533–1550LinkGoogle Scholar
  • Snir E. M., Hitt L. M. Costly bidding in online markets for IT services. Management Sci. (2003) 49(11):1504–1520LinkGoogle Scholar
  • Sundararajan A. Nonlinear pricing of information goods. Management Sci. (2004) 50(12):1660–1673LinkGoogle Scholar
  • Sundararajan A. Pricing digital marketing: Information, risk sharing and performance. (2006) . Working paper, New York University, New YorkGoogle Scholar
  • Varian H. R. Position auctions. Internat. J. Indust. Organ. (2007) 25(6):1163–1178CrossrefGoogle Scholar
  • Weber T. A., Zheng Z. A model of search intermediaries and paid referrals. Inform. Systems Res. (2007) 18(4):414–436LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.