IDEAS home Printed from https://ideas.repec.org/p/iek/wpaper/0904.html

Optimal quality scores in sponsored search auctions: Full extraction of advertisers' surplus

Author

Listed:
  • Kiho Yoon

    (Department of Economics, Korea University, Seoul, South Korea)

Abstract

This paper shows that the quality scores in sponsored search auctions can be optimally chosen to extract all the advertisers' surplus. The reason for the full extraction result is that the quality scores may effectively set all the bidders' valuations equal to the highest valuation, which induces intense bidding competition.

Suggested Citation

  • Kiho Yoon, 2009. "Optimal quality scores in sponsored search auctions: Full extraction of advertisers' surplus," Discussion Paper Series 0904, Institute of Economic Research, Korea University.
    • Handle: RePEc:iek:wpaper:0904
    as

    Download full text from publisher

    File URL: http://econ.korea.ac.kr/~ri/WorkingPapers/w0904.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Varian, Hal R., 2007. "Position auctions," International Journal of Industrial Organization, Elsevier, vol. 25(6), pages 1163-1178, December.
    2. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
    3. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    4. Evans David S., 2008. "The Economics of the Online Advertising Industry," Review of Network Economics, De Gruyter, vol. 7(3), pages 1-33, September.
    5. Cremer, Jacques & McLean, Richard P, 1988. "Full Extraction of the Surplus in Bayesian and Dominant Strategy Auctions," Econometrica, Econometric Society, vol. 56(6), pages 1247-1257, November.
    6. Susan Athey & Glenn Ellison, 2011. "Position Auctions with Consumer Search," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 126(3), pages 1213-1270.
    7. David S. Evans, 2009. "The Online Advertising Industry: Economics, Evolution, and Privacy," Journal of Economic Perspectives, American Economic Association, vol. 23(3), pages 37-60, Summer.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hummel, Patrick, 2016. "Position auctions with dynamic resizing," International Journal of Industrial Organization, Elsevier, vol. 45(C), pages 38-46.
    2. Emanuele Tarantino, 2012. "A Note on Vertical Search Engines’ Foreclosure," Chapters, in: Joseph E. Harrington Jr & Yannis Katsoulacos (ed.), Recent Advances in the Analysis of Competition Policy and Regulation, chapter 8, Edward Elgar Publishing.
    3. Yi Zhu & Kenneth C. Wilbur, 2011. "Hybrid Advertising Auctions," Marketing Science, INFORMS, vol. 30(2), pages 249-273, 03-04.
    4. Avi Goldfarb, 2014. "What is Different About Online Advertising?," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 44(2), pages 115-129, March.
    5. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    6. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    7. Yi Zhu & Kenneth C. Wilbur, 2008. "Strategic Bidding in Hybrid CPC/CPM Auctions," Working Papers 08-25, NET Institute, revised Oct 2008.
    8. Nicolás Figueroa & Vasiliki Skreta, 2011. "Optimal allocation mechanisms with single-dimensional private information," Review of Economic Design, Springer;Society for Economic Design, vol. 15(3), pages 213-243, September.
    9. Michael Ostrovsky & Michael Schwarz, 2023. "Reserve Prices in Internet Advertising Auctions: A Field Experiment," Journal of Political Economy, University of Chicago Press, vol. 131(12), pages 3352-3376.
    10. Renato Gomes, 2014. "Optimal auction design in two-sided markets," RAND Journal of Economics, RAND Corporation, vol. 45(2), pages 248-272, June.
    11. Tarantino, Emanuele, 2013. "A simple model of vertical search engines foreclosure," Telecommunications Policy, Elsevier, vol. 37(1), pages 1-12.
    12. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    13. Dirk Bergemann & Alessandro Bonatti, 2010. "Targeting in Advertising Markets: Implications for Offline vs. Online Media," Levine's Working Paper Archive 661465000000000284, David K. Levine.
    14. Yu (Jeffrey) Hu & Jiwoong Shin & Zhulei Tang, 2016. "Incentive Problems in Performance-Based Online Advertising Pricing: Cost per Click vs. Cost per Action," Management Science, INFORMS, vol. 62(7), pages 2022-2038, July.
    15. Alexandre Cornière & Greg Taylor, 2014. "Integration and search engine bias," RAND Journal of Economics, RAND Corporation, vol. 45(3), pages 576-597, September.
    16. David S. Evans, 2009. "The Online Advertising Industry: Economics, Evolution, and Privacy," Journal of Economic Perspectives, American Economic Association, vol. 23(3), pages 37-60, Summer.
    17. Caragiannis, Ioannis & Kaklamanis, Christos & Kanellopoulos, Panagiotis & Kyropoulou, Maria & Lucier, Brendan & Paes Leme, Renato & Tardos, Éva, 2015. "Bounding the inefficiency of outcomes in generalized second price auctions," Journal of Economic Theory, Elsevier, vol. 156(C), pages 343-388.
    18. Murali Agastya & Oleksii Birulin, 2023. "Optimal Task Scheduling under Adverse Selection and Hidden Actions," American Economic Journal: Microeconomics, American Economic Association, vol. 15(2), pages 660-698, May.
    19. Thompson, David R.M. & Leyton-Brown, Kevin, 2017. "Computational analysis of perfect-information position auctions," Games and Economic Behavior, Elsevier, vol. 102(C), pages 583-623.
    20. Mohammad Akbarpour & Shengwu Li, 2020. "Credible Auctions: A Trilemma," Econometrica, Econometric Society, vol. 88(2), pages 425-467, March.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • M37 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Marketing and Advertising - - - Advertising

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:iek:wpaper:0904. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Kim, Jisoo (email available below). General contact details of provider: https://edirc.repec.org/data/ierkukr.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.