On the stability of generalized second price auctions with budgets

From MaRDI portal
Publication:315522

DOI10.1007/978-3-642-54423-1_60zbMATH Open1346.91096arXiv1309.6474OpenAlexW1936473545MaRDI QIDQ315522FDOQ315522


Authors: J. Díaz, Ioannis Giotis, Evangelos Markakis, L. M. Kirousis, Maria Serna Edit this on Wikidata


Publication date: 21 September 2016

Published in: Theory of Computing Systems, LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

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


Full work available at URL: https://arxiv.org/abs/1309.6474




Recommendations




Cites Work


Cited In (3)





This page was built for publication: On the stability of generalized second price auctions with budgets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q315522)