Publication: Optimal keyword bidding in search-based advertising with budget constraint and stochastic ad position
| dc.contributor.author | Küçükaydın, Hande | |
| dc.contributor.author | Selçuk, Bariş | |
| dc.contributor.author | Özlük, Özgür | |
| dc.contributor.institution | Küçükaydın, Hande, Department of Industrial Engineering, MEF University, Istanbul, Turkey | |
| dc.contributor.institution | Selçuk, Bariş, Department of Industrial Engineering, Bahçeşehir Üniversitesi, Istanbul, Turkey | |
| dc.contributor.institution | Özlük, Özgür, Department of Industrial Engineering, MEF University, Istanbul, Turkey | |
| dc.date.accessioned | 2025-10-05T15:49:01Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | This paper analyses the search-based advertising problem from an advertiser’s view point, and proposes optimal bid prices for a set of keywords targeted for the advertising campaign. The advertiser aims to maximise its expected potential revenue given a total budget constraint from a search-based advertising campaign. Optimal bid prices are formulated by considering various characteristics of the keywords such that the expected revenue from a keyword is a function of the ad’s position on the search page, and the ad position is a stochastic function of both the bid price and the competitive landscape for that keyword. We explore this problem analytically and numerically in an effort to generate important managerial insights for campaign setters. © 2020 Elsevier B.V., All rights reserved. | |
| dc.identifier.doi | 10.1080/01605682.2019.1567650 | |
| dc.identifier.endpage | 578 | |
| dc.identifier.issn | 14769360 | |
| dc.identifier.issn | 01605682 | |
| dc.identifier.issue | 4 | |
| dc.identifier.scopus | 2-s2.0-85064686533 | |
| dc.identifier.startpage | 566 | |
| dc.identifier.uri | https://doi.org/10.1080/01605682.2019.1567650 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14719/10513 | |
| dc.identifier.volume | 71 | |
| dc.language.iso | en | |
| dc.publisher | Taylor and Francis Ltd. michael.wagreich@univie.ac.at | |
| dc.relation.source | Journal of the Operational Research Society | |
| dc.subject.authorkeywords | Internet | |
| dc.subject.authorkeywords | Knapsack Problem | |
| dc.subject.authorkeywords | Nonlinear Optimisation | |
| dc.subject.authorkeywords | Pricing | |
| dc.subject.authorkeywords | Search-based Advertising | |
| dc.subject.authorkeywords | Stochastic Models | |
| dc.subject.authorkeywords | Budget Control | |
| dc.subject.authorkeywords | Combinatorial Optimization | |
| dc.subject.authorkeywords | Costs | |
| dc.subject.authorkeywords | Economics | |
| dc.subject.authorkeywords | Internet | |
| dc.subject.authorkeywords | Marketing | |
| dc.subject.authorkeywords | Nonlinear Programming | |
| dc.subject.authorkeywords | Stochastic Systems | |
| dc.subject.authorkeywords | Advertising Campaign | |
| dc.subject.authorkeywords | Budget Constraint | |
| dc.subject.authorkeywords | Expected Revenue | |
| dc.subject.authorkeywords | Knapsack Problems | |
| dc.subject.authorkeywords | Non-linear Optimisation | |
| dc.subject.authorkeywords | Potential Revenue | |
| dc.subject.authorkeywords | Search-based | |
| dc.subject.authorkeywords | Stochastic Functions | |
| dc.subject.authorkeywords | Stochastic Models | |
| dc.subject.indexkeywords | Budget control | |
| dc.subject.indexkeywords | Combinatorial optimization | |
| dc.subject.indexkeywords | Costs | |
| dc.subject.indexkeywords | Economics | |
| dc.subject.indexkeywords | Internet | |
| dc.subject.indexkeywords | Marketing | |
| dc.subject.indexkeywords | Nonlinear programming | |
| dc.subject.indexkeywords | Stochastic systems | |
| dc.subject.indexkeywords | Advertising campaign | |
| dc.subject.indexkeywords | Budget constraint | |
| dc.subject.indexkeywords | Expected revenue | |
| dc.subject.indexkeywords | Knapsack problems | |
| dc.subject.indexkeywords | Non-linear optimisation | |
| dc.subject.indexkeywords | Potential revenue | |
| dc.subject.indexkeywords | Search-based | |
| dc.subject.indexkeywords | Stochastic functions | |
| dc.subject.indexkeywords | Stochastic models | |
| dc.title | Optimal keyword bidding in search-based advertising with budget constraint and stochastic ad position | |
| dc.type | Article | |
| dcterms.references | Abhishek, Vibhanshu, Optimal bidding in multi-item multislot sponsored search auctions, Operations Research, 61, 4, pp. 855-873, (2013), Amaldoss, Wilfred, Keyword search advertising and first-page bid estimates: A strategic analysis, Management Science, 61, 3, pp. 507-519, (2015), Ayanso, Anteneh, The moderating effects of keyword competition on the determinants of ad position in sponsored search advertising, Decision Support Systems, 70, pp. 42-59, (2015), Ayanso, Anteneh, Efficiency evaluation in search advertising, Decision Sciences, 44, 5, pp. 877-913, (2013), Operations Research, (1995), Bretthauer, Kurt M., The nonlinear knapsack problem - Algorithms and applications, European Journal of Operational Research, 138, 3, pp. 459-472, (2002), Atlas Rank Report II how Search Engine Rank Impacts Conversions, (2004), Chan, Tat Y., Measuring the lifetime value of customers acquired from Google search advertising, Marketing Science, 30, 5, pp. 837-850, (2011), Cholette, Susan C., Optimal Keyword Bids in Search-Based Advertising with Stochastic Advertisement Positions, Journal of Optimization Theory and Applications, 152, 1, pp. 225-244, (2012), Devenur, Nikhil R., The adwords problem: Online keyword matching with budgeted bidders under random permutations, Proceedings of the ACM Conference on Electronic Commerce, pp. 71-78, (2009) | |
| dspace.entity.type | Publication | |
| local.indexed.at | Scopus | |
| person.identifier.scopus-author-id | 36655949100 | |
| person.identifier.scopus-author-id | 14622013500 | |
| person.identifier.scopus-author-id | 16230962700 |
