Keyword-level Bayesian online bid optimization for sponsored search advertising

DOI10.1007/S43069-024-00322-YMaRDI QIDQ6559525zbMATH OpenFDO

Authors Kaito Majima, Kosuke Kawakami, Kota Ishizuka, Kazuhide Nakata

Publication date 21 June 2024

Published in SN Operations Research Forum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S43069-024-00322-Y

zbMATH Keywords

bandit algorithmBayesian inferencebid price optimizationonline advertisingonline optimization

Mathematics Subject Classification ID

Marketing, advertising (90B60)

Recommendations

• Optimal dynamic multi-keyword bidding policy of an advertiser in search-based advertising
• Optimal bidding in multi-item multislot sponsored search auctions
• Optimal Budget Allocation Across Search Advertising Markets
• Dynamic bidding strategies in search-based advertising
• Optimal keyword bidding in search-based advertising with target exposure levels

Cites work

• Asymptotic equivalence of Bayes cross validation and widely applicable information criterion in singular learning theory
• Bandits with knapsacks
• Bi-objective decision making in global optimization based on statistical models
• Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
• Equation of state calculations by fast computing machines
• Finite-time analysis of the multiarmed bandit problem
• scientific article; zbMATH DE number 6377992 (Why is no real title available?)
• Keyword portfolio optimization in paid search advertising
• Online joint bid/daily budget optimization of Internet advertising campaigns
• Optimal bidding in multi-item multislot sponsored search auctions
• The Nonstochastic Multiarmed Bandit Problem

This page was built for publication: Keyword-level Bayesian online bid optimization for sponsored search advertising

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559525)