Title: Optimal bidding in the sponsored search
Other Titles: Optimal Bidding in the Sponsored Search
Language: English
Authors: Grünbacher, Sophie 
Qualification level: Diploma
Advisor: Tragler, Gernot 
Issue Date: 2014
Number of Pages: 64
Qualification level: Diploma
In this thesis, I describe how search engine advertising works in the sponsored search, the underlying Generalized Second-Price (GSP) Auction, which is the mechanism used by search engines to sell online advertising, and the difficulties to find an optimal bid. For that purpose, I present a model to optimize the bids in an advertiser's campaign and describe the Generalized Method of Moments (GMM) estimator needed to estimate necessary parameters for the bid optimization. Moreover, I analyze whether or not it is possible to improve the performance of a ticket agency's search engine advertising by using the bidding policy and by automizing the bid optimization. To validate the effectiveness of that model, I use a data set from the Google Adwords campaign of that ticket agency, compute the optimal bids, and implement them into their campaign. It appears that for the ticket agency the proposed bidding technique is not as effective as previously imagined. On the contrary, the return on investment of the ticket agency's advertising campaign based on a Difference-in-Differences (DiD) approach decreases by 500%. That result shows that it would be necessary to provide much more information to the model than in this thesis, to be able to improve this ticket agency's Advertising campaign.
Keywords: sponsored search; bid optimization; generalized second-price auctions; generalized method of moments
URI: https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-63106
Library ID: AC12072856
Organisation: E105 - Institut für Wirtschaftsmathematik 
Publication Type: Thesis
Appears in Collections:Thesis

Files in this item:

Show full item record

Page view(s)

checked on Feb 18, 2021


checked on Feb 18, 2021

Google ScholarTM


Items in reposiTUm are protected by copyright, with all rights reserved, unless otherwise indicated.