Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Equilibria of GSP for Range Auction
verfasst von : H. F. Ting, Xiangzhong Xiang
Erschienen in: Computing and Combinatorics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Position auction is a well-studied model for analyzing online auctions for internet advertisement, in which a set of advertisers bid for a set of slots in a search result page to display their advertisement links. In particular, it was proved in [10,11] that the Generalized Second Price (GSP) mechanism for position auction has many interesting properties. In this paper, we extend these results to range auction, in which a bidder may specify a range of slots he is interested in. We prove GSP for range auction has an envy free equilibrium, which is bidder optimal and has the minimum pay property. Further, this equilibrium is equal to the outcome of the Vickrey-Clarke-Groves mechanism. We also show that the social welfare of any equilibrium of GSP for range auctions is not far from the optimal; it is at least 1/2 of the optimal.