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. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Díaz, J., Giotis, I., Kirousis, L., Markakis, E., & Serna, M. (2014). On the stability of generalized second price auctions with budgets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8392 LNCS, pp. 695–706). Springer Verlag. https://doi.org/10.1007/978-3-642-54423-1_60
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
