IDEAS home Printed from https://ideas.repec.org/a/pal/jmarka/v11y2023i3d10.1057_s41270-022-00170-x.html
   My bibliography  Save this article

Analysis of online position auctions for search engine marketing

Author

Listed:
  • Margarida V. B. Santos

    (Universidade do Porto)

  • Isabel Mota

    (Universidade do Porto and CEFUP (Center for Economics and Finance, UP))

  • Pedro Campos

    (Universidade do Porto and LIAAD (Lab. Artificial Intelligence and Decision Support) at INESC.TEC)

Abstract

Sponsored advertising on search engines is one of the fastest growing online advertising marketplaces. The space available for paid ads, or positions, is sold using auctions and payment is calculated considering the number of clicks each position receives. Two mechanisms are generally used in position auctions: Generalized Second Price (GSP) (e.g. Google, Yahoo!) and Vickrey–Clarke–Groves (VCG) (e.g. Facebook). To understand which mechanism guarantees the highest payoff to market players (search engines and advertisers), a multi-agent simulation is developed in Netlogo. Using the generated data, a supervised learning-based analysis on search engines and bidders’ payoffs is made using linear regression models and regression trees. Results suggest that the average payoff for auctioneers (the search engines) and bidders (the advertisers), the price for each position, and first bidder’s payment, are significantly different in the GSP and VCG mechanisms. We also found the mechanism that generates the highest payoff for the search engine is the VCG, while for the bidders it is the GSP.

Suggested Citation

  • Margarida V. B. Santos & Isabel Mota & Pedro Campos, 2023. "Analysis of online position auctions for search engine marketing," Journal of Marketing Analytics, Palgrave Macmillan, vol. 11(3), pages 409-425, September.
    • Handle: RePEc:pal:jmarka:v:11:y:2023:i:3:d:10.1057_s41270-022-00170-x
    DOI: 10.1057/s41270-022-00170-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/s41270-022-00170-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1057/s41270-022-00170-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Leon Yang Chu & Hamid Nazerzadeh & Heng Zhang, 2020. "Position Ranking and Auctions for Online Marketplaces," Management Science, INFORMS, vol. 66(8), pages 3617-3634, August.
    2. Christopher Boyer & B. Brorsen & Tong Zhang, 2014. "Common-value auction versus posted-price selling: an agent-based model approach," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 9(1), pages 129-149, April.
    3. 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.
    4. Yongmin Chen & Chuan He, 2011. "Paid Placement: Advertising and Search on the Internet," Economic Journal, Royal Economic Society, vol. 121(556), pages 309-328, November.
    5. Hal R. Varian & Christopher Harris, 2014. "The VCG Auction in Theory and Practice," American Economic Review, American Economic Association, vol. 104(5), pages 442-445, May.
    6. Thomas W. L. Norman, 2021. "Evolutionary stability in the generalized second-price auction," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 71(1), pages 235-250, February.
    7. Christopher Boyer & B. Brorsen, 2014. "Implications of a Reserve Price in an Agent-Based Common-Value Auction," Computational Economics, Springer;Society for Computational Economics, vol. 43(1), pages 33-51, January.
    8. Francesco Decarolis & Maris Goldmanis & Antonio Penta, 2020. "Marketing Agencies and Collusive Bidding in Online Ad Auctions," Management Science, INFORMS, vol. 66(10), pages 4433-4454, October.
    9. Ron Berman & Zsolt Katona, 2013. "The Role of Search Engine Optimization in Search Marketing," Marketing Science, INFORMS, vol. 32(4), pages 644-651, July.
    10. Aurélien Vermeir & Hugues Bersini, 2015. "Best practices in programming agent-based models in economics and finance," ULB Institutional Repository 2013/195956, ULB -- Universite Libre de Bruxelles.
    11. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    12. Mochon, A. & Saez, Y. & Gomez-Barroso, J.L. & Isasi, P., 2012. "Exploring pricing rules in combinatorial sealed-bid auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 82(2), pages 462-478.
    13. Patrick Hummel, 2018. "Hybrid mechanisms for Vickrey–Clarke–Groves and generalized second-price bids," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 331-350, March.
    14. Emiko Fukuda & Yoshio Kamijo & Ai Takeuchi & Michiharu Masui & Yukihiko Funaki, 2013. "Theoretical and experimental investigations of the performance of keyword auction mechanisms," RAND Journal of Economics, RAND Corporation, vol. 44(3), pages 438-461, September.
    15. Annalisa Fabretti & Stefano Herzel, 2017. "An Agent Based Model for a Double Auction with Convex Incentives," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 20(1), pages 1-7.
    16. Bae, Jinsoo & Kagel, John H., 2019. "An experimental study of the generalized second price auction," International Journal of Industrial Organization, Elsevier, vol. 63(C), pages 44-68.
    17. Andreoni James & Miller John H., 1995. "Auctions with Artificial Adaptive Agents," Games and Economic Behavior, Elsevier, vol. 10(1), pages 39-64, July.
    18. Che, Yeon-Koo & Choi, Syngjoo & Kim, Jinwoo, 2017. "An experimental study of sponsored-search auctions," Games and Economic Behavior, Elsevier, vol. 102(C), pages 20-43.
    19. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    20. Prajit K. Dutta, 1999. "Strategies and Games: Theory and Practice," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262041693, December.
    21. Hal R. Varian, 2009. "Online Ad Auctions," American Economic Review, American Economic Association, vol. 99(2), pages 430-434, May.
    22. Song Yao & Carl F. Mela, 2011. "A Dynamic Model of Sponsored Search Advertising," Marketing Science, INFORMS, vol. 30(3), pages 447-468, 05-06.
    23. A. Vermeir & H. Bersini, 2015. "Best Practices in Programming Agent-Based Models in Economics and Finance," Lecture Notes in Economics and Mathematical Systems, in: Frédéric Amblard & Francisco J. Miguel & Adrien Blanchet & Benoit Gaudou (ed.), Advances in Artificial Economics, edition 127, pages 57-68, Springer.
    24. Zsolt Katona & Miklos Sarvary, 2010. "The Race for Sponsored Links: Bidding Patterns for Search Advertising," Marketing Science, INFORMS, vol. 29(2), pages 199-215, 03-04.
    25. Fei Long & Kinshuk Jerath & Miklos Sarvary, 2022. "Designing an Online Retail Marketplace: Leveraging Information from Sponsored Advertising," Marketing Science, INFORMS, vol. 41(1), pages 115-138, January.
    26. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    27. Nelson Alfonso Gómez-Cruz & Isabella Loaiza Saa & Francisco Fernando Ortega Hurtado, 2017. "Agent-based simulation in management and organizational studies: a survey," European Journal of Management and Business Economics, Emerald Group Publishing Limited, vol. 26(3), pages 313-328, October.
    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. Patrick Hummel, 2018. "Hybrid mechanisms for Vickrey–Clarke–Groves and generalized second-price bids," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(1), pages 331-350, March.
    2. Yi Zhu & Kenneth C. Wilbur, 2011. "Hybrid Advertising Auctions," Marketing Science, INFORMS, vol. 30(2), pages 249-273, 03-04.
    3. Amin Sayedi & Kinshuk Jerath & Marjan Baghaie, 2018. "Exclusive Placement in Online Advertising," Marketing Science, INFORMS, vol. 37(6), pages 970-986, November.
    4. Karthik Kannan & Rajib L. Saha & Warut Khern-am-nuai, 2022. "Identifying Perverse Incentives in Buyer Profiling on Online Trading Platforms," Information Systems Research, INFORMS, vol. 33(2), pages 464-475, June.
    5. Yan, Haomin, 2021. "Position auctions with multi-unit demands," Games and Economic Behavior, Elsevier, vol. 127(C), pages 179-193.
    6. Anna Pechan & Gert Brunekreeft & Martin Palovic, "undated". "Increasing resilience of electricity networks: Auctioning of priority supply to minimize outage costs," Bremen Energy Working Papers 0045, Bremen Energy Research.
    7. Yan Chen & Peter Cramton & John A. List & Axel Ockenfels, 2021. "Market Design, Human Behavior, and Management," Management Science, INFORMS, vol. 67(9), pages 5317-5348, September.
    8. Ragavendran Gopalakrishnan & Eric Bax & Krishna Prasad Chitrapura & Sachin Garg, 2015. "Portfolio Allocation for Sellers in Online Advertising," Papers 1506.02020, arXiv.org.
    9. James Li & Eric Bax & Nilanjan Roy & Andrea Leistra, 2015. "VCG Payments for Portfolio Allocations in Online Advertising," Papers 1506.02013, arXiv.org.
    10. Chen Jin & Luyi Yang & Kartik Hosanagar, 2023. "To Brush or Not to Brush: Product Rankings, Consumer Search, and Fake Orders," Information Systems Research, INFORMS, vol. 34(2), pages 532-552, June.
    11. Alex Jiyoung Kim & Subramanian Balachander, 2023. "Coordinating traditional media advertising and online advertising in brand marketing," Production and Operations Management, Production and Operations Management Society, vol. 32(6), pages 1865-1879, June.
    12. Fei Long & Kinshuk Jerath & Miklos Sarvary, 2022. "Designing an Online Retail Marketplace: Leveraging Information from Sponsored Advertising," Marketing Science, INFORMS, vol. 41(1), pages 115-138, January.
    13. 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.
    14. W. Jason Choi & Amin Sayedi, 2019. "Learning in Online Advertising," Marketing Science, INFORMS, vol. 38(4), pages 584-608, July.
    15. Mochon, A. & Saez, Y. & Gomez-Barroso, J.L. & Isasi, P., 2012. "Exploring pricing rules in combinatorial sealed-bid auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 82(2), pages 462-478.
    16. Shijie Lu & Yi Zhu & Anthony Dukes, 2015. "Position Auctions with Budget Constraints: Implications for Advertisers and Publishers," Marketing Science, INFORMS, vol. 34(6), pages 897-905, November.
    17. Maria-Florina Balcan & Siddharth Prasad & Tuomas Sandholm, 2023. "Bicriteria Multidimensional Mechanism Design with Side Information," Papers 2302.14234, arXiv.org, revised Jun 2023.
    18. Hitoshi Matsushima, 2021. "Auctions with Ethical Concerns," CARF F-Series CARF-F-515, Center for Advanced Research in Finance, Faculty of Economics, The University of Tokyo.
    19. 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.
    20. Milgrom, Paul, 2010. "Simplified mechanisms with an application to sponsored-search auctions," Games and Economic Behavior, Elsevier, vol. 70(1), pages 62-70, September.

    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:pal:jmarka:v:11:y:2023:i:3:d:10.1057_s41270-022-00170-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.