IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v5y2024i2d10.1007_s43069-024-00322-y.html
   My bibliography  Save this article

Keyword-Level Bayesian Online Bid Optimization for Sponsored Search Advertising

Author

Listed:
  • Kaito Majima

    (Tokyo Institute of Technology)

  • Kosuke Kawakami

    (Tokyo Institute of Technology
    negocia, Inc.)

  • Kota Ishizuka

    (negocia, Inc.)

  • Kazuhide Nakata

    (Tokyo Institute of Technology)

Abstract

Bid price optimization in online advertising is a challenging task due to its high uncertainty. In this paper, we propose a bid price optimization algorithm focused on keyword-level bidding for pay-per-click sponsored search ads, which is a realistic setting for many firms. There are three characteristics of this setting: “The setting targets the optimization of bids for each keyword in pay-per-click sponsored search advertising”, “The only information available to advertisers is the number of impressions, clicks, conversions, and advertising cost for each keyword”, and “Advertisers bid daily and set monthly budgets on a campaign basis”. Our algorithm first predicts the performance of keywords as a distribution by modeling the relationship between ad metrics through a Bayesian network and performing Bayesian inference. Then, it outputs the bid price by means of a bandit algorithm and online optimization. This approach enables online optimization that considers uncertainty from the limited information available to advertisers. We conducted simulations using real data and confirmed the effectiveness of the proposed method for both open-source data and data provided by negocia, Inc., which provides an automated Internet advertising management system.

Suggested Citation

  • Kaito Majima & Kosuke Kawakami & Kota Ishizuka & Kazuhide Nakata, 2024. "Keyword-Level Bayesian Online Bid Optimization for Sponsored Search Advertising," SN Operations Research Forum, Springer, vol. 5(2), pages 1-32, June.
    • Handle: RePEc:spr:snopef:v:5:y:2024:i:2:d:10.1007_s43069-024-00322-y
    DOI: 10.1007/s43069-024-00322-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-024-00322-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s43069-024-00322-y?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. Vibhanshu Abhishek & Kartik Hosanagar, 2013. "Optimal Bidding in Multi-Item Multislot Sponsored Search Auctions," Operations Research, INFORMS, vol. 61(4), pages 855-873, August.
    2. Antanas Žilinskas & James Calvin, 2019. "Bi-objective decision making in global optimization based on statistical models," Journal of Global Optimization, Springer, vol. 74(4), pages 599-609, August.
    3. Symitsi, Efthymia & Markellos, Raphael N. & Mantrala, Murali K., 2022. "Keyword portfolio optimization in paid search advertising," European Journal of Operational Research, Elsevier, vol. 303(2), pages 767-778.
    4. Xiaomeng Du & Meng Su & Xiaoquan (Michael) Zhang & Xiaona Zheng, 2017. "Bidding for Multiple Keywords in Sponsored Search Advertising: Keyword Categories and Match Types," Information Systems Research, INFORMS, vol. 28(4), pages 711-722, December.
    5. Hongxia Yang & Robert Ormandi & Han‐Yun Tsao & Quan Lu, 2016. "Estimating rates of rare events through a multidimensional dynamic hierarchical Bayesian framework," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 32(3), pages 340-353, May.
    6. Hongxia Yang & Robert Ormandi & Han‐Yun Tsao & Quan Lu, 2016. "Rejoinder to ‘Estimating rates of rare events through a multidimensional dynamic hierarchical Bayesian framework’," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 32(3), pages 357-357, May.
    7. Anindya Ghose & Sha Yang, 2009. "An Empirical Analysis of Search Engine Advertising: Sponsored Search in Electronic Markets," Management Science, INFORMS, vol. 55(10), pages 1605-1622, 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. Lijia Ma & Xingchen Xu & Yong Tan, 2024. "Crafting Knowledge: Exploring the Creative Mechanisms of Chat-Based Search Engines," Papers 2402.19421, arXiv.org.
    2. Tunuguntla, Vaishnavi & Rakshit, Krishanu & Basu, Preetam, 2023. "Bidding for an optimal portfolio of keywords in sponsored search advertising: From generic to branded keywords," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1424-1440.
    3. Darius Schlangenotto & Martin Poniatowski & Dennis Kundisch, 2018. "What Drives Paid Search Success: A Systematic Literature Review," Working Papers Dissertations 31, Paderborn University, Faculty of Business Administration and Economics.
    4. Mengzhou Zhuang & Eric (Er) Fang & Jongkuk Lee & Xiaoling Li, 2021. "The Effects of Price Rank on Clicks and Conversions in Product List Advertising on Online Retail Platforms," Information Systems Research, INFORMS, vol. 32(4), pages 1412-1430, December.
    5. Vibhanshu Abhishek & Kartik Hosanagar & Peter S. Fader, 2015. "Aggregation Bias in Sponsored Search Data: The Curse and the Cure," Marketing Science, INFORMS, vol. 34(1), pages 59-77, January.
    6. Karthik Kannan & Vandith Pamuru & Yaroslav Rosokha, 2023. "Analyzing Frictions in Generalized Second-Price Auction Markets," Information Systems Research, INFORMS, vol. 34(4), pages 1437-1454, December.
    7. Ashish Agarwal & Kartik Hosanagar & Michael D. Smith, 2015. "Do Organic Results Help or Hurt Sponsored Search Performance?," Information Systems Research, INFORMS, vol. 26(4), pages 695-713, December.
    8. Kim, Alex Jiyoung & Jang, Sungha & Shin, Hyun S., 2021. "How should retail advertisers manage multiple keywords in paid search advertising?," Journal of Business Research, Elsevier, vol. 130(C), pages 539-551.
    9. Peter Landry, 2021. "Keywords, limited consideration, and organic product listings," Quantitative Marketing and Economics (QME), Springer, vol. 19(3), pages 505-566, December.
    10. Siddharth Bhattacharya & Jing Gong & Sunil Wattal, 2022. "Competitive Poaching in Search Advertising: Two Randomized Field Experiments," Information Systems Research, INFORMS, vol. 33(2), pages 599-619, June.
    11. 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.
    12. Manmohan Aseri & Amit Mehra & Vijay Mookerjee & Hong Xu, 2024. "Should an Ad Agency Offer Geoconquesting or Protection from It?," Information Systems Research, INFORMS, vol. 35(2), pages 850-870, June.
    13. Carsten D. Schultz, 2020. "The impact of ad positioning in search engine advertising: a multifaceted decision problem," Electronic Commerce Research, Springer, vol. 20(4), pages 945-968, December.
    14. Jang, Sungha & Kim, Alex Jiyoung & Yoon, Jiho, 2022. "Multiple keywords management in sponsored search advertising with interrelated consumer clicks," Journal of Business Research, Elsevier, vol. 140(C), pages 459-470.
    15. Feng Wang & Li Zuo & Zhi Yang & Yueyan Wu, 2019. "Mobile searching versus online searching: differential effects of paid search keywords on direct and indirect sales," Journal of the Academy of Marketing Science, Springer, vol. 47(6), pages 1151-1165, November.
    16. Tunuguntla, Vaishnavi & Basu, Preetam & Rakshit, Krishanu & Ghosh, Debabrata, 2019. "Sponsored search advertising and dynamic pricing for perishable products under inventory-linked customer willingness to pay," European Journal of Operational Research, Elsevier, vol. 276(1), pages 119-132.
    17. Carattini, Stefano & Gillingham, Kenneth & Meng, Xiangyu & Yoeli, Erez, 2024. "Peer-to-peer solar and social rewards: Evidence from a field experiment," Journal of Economic Behavior & Organization, Elsevier, vol. 219(C), pages 340-370.
    18. Cai, Ya-Jun & Lo, Chris K.Y., 2020. "Omni-channel management in the new retailing era: A systematic review and future research agenda," International Journal of Production Economics, Elsevier, vol. 229(C).
    19. Stephan Wachtel & Thomas Otter, 2013. "Successive Sample Selection and Its Relevance for Management Decisions," Marketing Science, INFORMS, vol. 32(1), pages 170-185, September.
    20. Martin Spann & Oliver Hinz & Vandana Ramachandran, 2013. "Business and Information Systems Engineering and Marketing," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 5(3), pages 127-128, June.

    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:spr:snopef:v:5:y:2024:i:2:d:10.1007_s43069-024-00322-y. 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.springer.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.