On the stability of generalized second price auctions with budgets

Josep Díaz, Ioannis Giotis, Lefteris Kirousis, Evangelos Markakis, Maria Serna

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationLATIN 2014
Subtitle of host publicationTheoretical Informatics - 11th Latin American Symposium, Proceedings
PublisherSpringer Verlag
Pages695-706
Number of pages12
ISBN (Print)9783642544224
DOIs
StatePublished - 2014
Event11th Latin American Theoretical Informatics Symposium, LATIN 2014 - Montevideo, Uruguay
Duration: Mar 31 2014Apr 4 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8392 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th Latin American Theoretical Informatics Symposium, LATIN 2014
Country/TerritoryUruguay
CityMontevideo
Period3/31/144/4/14

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On the stability of generalized second price auctions with budgets'. Together they form a unique fingerprint.

Cite this