On the Stability of Generalized Second Price Auctions with Budgets

The Generalized Second Price (GSP) auction used typically to model sponsored search auctions does not include the notion of budget constraints, which is present in practice. Motivated by this, we introduce the different variants of GSP auctions that take budgets into account in natural ways. We examine their stability by focusing on the existence of Nash equilibria and envy-free assignments. We highlight the differences between these mechanisms and find that only some of them exhibit both notions of stability. This shows the importance of carefully picking the right mechanism to ensure stable outcomes in the presence of budgets.

[1]  Gagan Goel,et al.  Polyhedral Clinching Auctions and the AdWords Polytope , 2012, J. ACM.

[2]  R. Vohra,et al.  Algorithmic Game Theory: Sponsored Search Auctions , 2007 .

[3]  Deeparnab Chakrabarty,et al.  Budget constrained bidding in keyword auctions and online knapsack problems , 2008, WINE.

[4]  Nikhil R. Devanur,et al.  Budget smoothing for internet ad auctions: a game theoretic approach , 2013, EC '13.

[5]  Maurizio Naldi,et al.  Sponsored search auctions: an overview of research with emphasis on game theoretic aspects , 2012, Electronic Commerce Research.

[6]  Nicole Immorlica,et al.  Multi-unit auctions with budget-constrained bidders , 2005, EC '05.

[7]  Benjamin Edelman,et al.  Strategic bidder behavior in sponsored search auctions , 2007, Decis. Support Syst..

[8]  Yishay Mansour,et al.  Repeated Budgeted Second Price Ad Auction , 2011, Theory of Computing Systems.

[9]  David M. Pennock,et al.  Revenue analysis of a family of ranking rules for keyword auctions , 2007, EC '07.

[10]  Éva Tardos,et al.  Composable and efficient mechanisms , 2012, STOC '13.

[11]  Amos Fiat,et al.  Single valued combinatorial auctions with budgets , 2011, EC '11.

[12]  Annamária Kovács,et al.  Bayesian Combinatorial Auctions , 2008, ICALP.

[13]  Monika Henzinger,et al.  On Multiple Keyword Sponsored Search Auctions with Budgets , 2012, TEAC.

[14]  Lawrence M. Ausubel.  An Efficient Ascending-Bid Auction for Multiple Objects , 2004 .

[15]  Renato Paes Leme,et al.  On the efficiency of equilibria in generalized second price auctions , 2011, EC '11.

[16]  Noam Nisan,et al.  Multi-unit Auctions with Budget Limits , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[17]  Riccardo Colini-Baldeschi,et al.  Sponsored search auctions , 2013, WSDM.

[18]  Moshe Tennenholtz,et al.  Position Auctions with Budgets: Existence and Uniqueness , 2010 .

[19]  Jon Feldman,et al.  Budget optimization in search-based advertising auctions , 2006, EC '07.