On Best-Response Bidding in GSP Auctions
20 Pages Posted: 13 Feb 2008 Last revised: 6 Mar 2022
There are 2 versions of this paper
On Best-Response Bidding in GSP Auctions
Date Written: February 2008
Abstract
How should players bid in keyword auctions such as those used by Google, Yahoo! and MSN? We model ad auctions as a dynamic game of incomplete information, so we can study the convergence and robustness properties of various strategies. In particular, we consider best-response bidding strategies for a repeated auction on a single keyword, where in each round, each player chooses some optimal bid for the next round, assuming that the other players merely repeat their previous bids. We focus on a strategy we call Balanced Bidding (bb). If all players use the bb strategy, we show that bids converge to a bid vector that obtains in a complete information static model proposed by Edelman, Ostrovsky and Schwarz (2007). We prove that convergence occurs with probability 1, and we compute the expected time until convergence.
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
Position Auctions with Consumer Search
By Susan Athey and Glenn Ellison
-
Paid Placement: Advertising and Search on the Internet
By Yongmin Chen and Chuan He
-
An Empirical Analysis of Search Engine Advertising: Sponsored Search in Electronic Markets
By Anindya Ghose and Sha Yang
-
By Sha Yang and Anindya Ghose
-
From Generic to Branded: A Model of Spillover Dynamics in Paid Search Advertising
-
By Juan Feng, Hemant K. Bhargava, ...
-
Search Engine Advertising: Channel Substitution when Pricing Ads to Context
By Avi Goldfarb and Catherine E. Tucker
-
A Dynamic Model of Sponsored Search Advertising
By Song Yao and Carl F. Mela