Multi‐bidding strategy in sponsored search auctions

The generalized second price auction has recently become a much studied model for sponsored search auctions for Internet advertisement. Though it is known not to be incentive compatible, properties of its pure Nash equilibria have been well characterized under the single bidding strategy of each bidder. In this paper, we study the properties of pure Nash equilibria of the generalized second price auction when each bidder is allowed to submit more than one bid. This multi‐bidding strategy is noted to have been adopted by companies for keyword advertisements on search engines. In consideration of the pure Nash equilibria, we completely characterize conditions on the number of selling slots for a pure Nash equilibrium to exist, assuming all the advertisers are allowed to use multi‐bidding strategies or only one advertiser will use a multi‐bidding strategy. Our findings reveal interesting properties of limitations and potentials of the generalized second price auction for the sponsored search market.