Despite the tremendous commercial success of generalized second-price (GSP) keyword auctions, it still remains a big challenge for an advertiser to formulate an effective bidding strategy. In this paper, we strive to bridge this gap by proposing a framework for studying pure-strategy Nash equilibria in GSP auctions. We first analyze the equilibrium bidding behaviors by investigating the properties and distribution of all pure-strategy Nash equilibria. Our analysis shows that the set of all pure-strategy Nash equilibria of a GSP auction can be partitioned into separate convex polyhedra based on the order of bids if the valuations of all advertisers are distinct. We further show that only the polyhedron that allocates slots efficiently is weakly stable, thus allowing all inefficient equilibria to be weeded out. We then propose a novel refinement method for identifying a set of equilibria named the stable Nash equilibrium set (STNE) and prove that STNE is either the same as or a proper subset of the set of the well-known symmetrical Nash equilibria. These findings free both auctioneers and advertisers from complicated strategic thinking. The revenue of a GSP auction on STNE is at least the same as that of the classical Vickrey-Clarke-Groves mechanism and can be used as a benchmark for evaluating other mechanisms. At the same time, STNE provides advertisers a simple yet effective and stable bidding strategy.
Li, Linjing; Zeng, Daniel; and Zhao, Huimin
"Pure-Strategy Nash Equilibria of GSP Keyword Auction,"
Journal of the Association for Information Systems: Vol. 13
, Article 2.
Available at: http://aisel.aisnet.org/jais/vol13/iss2/2