Research Repository

Bounding the inefficiency of outcomes in generalized second price auctions

Caragiannis, Ioannis and Kaklamanis, Christos and Kanellopoulos, Panagiotis and Kyropoulou, Maria and Lucier, Brendan and Paes Leme, Renato and Tardos, Éva (2015) 'Bounding the inefficiency of outcomes in generalized second price auctions.' Journal of Economic Theory, 156. 343 - 388. ISSN 0022-0531

[img]
Preview
Text
1201.6429v2.pdf - Accepted Version

Download (410kB) | Preview

Abstract

The Generalized Second Price (GSP) auction is the primary auction used for monetizing the use of the Internet. It is well-known that truthtelling is not a dominant strategy in this auction and that inefficient equilibria can arise. Edelman et al. (2007) [11] and Varian (2007) [36] show that an efficient equilibrium always exists in the full information setting. Their results, however, do not extend to the case with uncertainty, where efficient equilibria might not exist. In this paper we study the space of equilibria in GSP, and quantify the efficiency loss that can arise in equilibria under a wide range of sources of uncertainty, as well as in the full information setting. The traditional Bayesian game models uncertainty in the valuations (types) of the participants. The Generalized Second Price (GSP) auction gives rise to a further form of uncertainty: the selection of quality factors resulting in uncertainty about the behavior of the underlying ad allocation algorithm. The bounds we obtain apply to both forms of uncertainty, and are robust in the sense that they apply under various perturbations of the solution concept, extending to models with information asymmetries and bounded rationality in the form of learning strategies. We present a constant bound (2.927) on the factor of the efficiency loss (price of anarchy) of the corresponding game for the Bayesian model of partial information about other participants and about ad quality factors. For the full information setting, we prove a surprisingly low upper bound of 1.282 on the price of anarchy over pure Nash equilibria, nearly matching a lower bound of 1.259 for the case of three advertisers. Further, we do not require that the system reaches equilibrium, and give similarly low bounds also on the quality degradation for any no-regret learning outcome. Our conclusion is that the number of advertisers in the auction has almost no impact on the price of anarchy, and that the efficiency of GSP is very robust with respect to the belief and rationality assumptions imposed on the participants.

Item Type: Article
Uncontrolled Keywords: Auction design, Equilibrium analysis, Price of anarchy, Bayesian games, Generalized second price auction, Keyword auctions
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Elements
Date Deposited: 04 Sep 2020 12:31
Last Modified: 04 Sep 2020 13:15
URI: http://repository.essex.ac.uk/id/eprint/23654

Actions (login required)

View Item View Item