Show simple item record

dc.contributor.authorChristoforou, Evgenia 
dc.contributor.authorFernández Anta, Antonio 
dc.contributor.authorSantos, Agustín 
dc.date.accessioned2021-07-13T10:19:31Z
dc.date.available2021-07-13T10:19:31Z
dc.date.issued2014-12-14
dc.identifier.citation1. Google.“google adwords”. www.adwords.google.com/. 2. Google.“how are ads ranked”. https://support.google.com/adwords/answer/1722122?topic=115, 2005. 3. L. M. Ausubel and P. Milgrom. The lovely but lonely vickrey auction. Combinatorial auctions, pages 17–40, 2006. 4. B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. Technical report, National Bureau of Economic Research, 2005. 5. M. O. Jackson and H. F. Sonnenschein. The linking of collective decisions and efficiency. manuscript, California Institute of Technology, 2003. 6. A. Santos, A. Fernández Anta, and L. López Fernández. Quid Pro Quo: a mechanism for fair collaboration in networked systems. PloS one, 8(9):e66575, 2013.
dc.identifier.urihttp://hdl.handle.net/20.500.12761/1459
dc.description.abstractAs advertisement is shifting from the traditional media to the Internet, advertising in web search engines has emerged in the form of sponsored search. Advertisers pay the search engine to show their content, usually in order to get traffic to their own websites. A large amount of the search engine’s income derives from sponsored search. In sponsored search, a number of advertisers are competing for a limited number of slots in each specific keyword search in the search engine. In order to distribute the available slots among the advertisers, search engines are starting to hold keyword auctions. The questions that appear in this setup from a mechanism design point of view are two, how to assign advertisers to slots (or vice versa), and how to price each slot. This work proposes a novel approach were distributing the slots among the advertisers is based on how much each advertiser values appearing in a keyword search slot at a specific time. The proposed approach makes this value independent of her true payment to the search engine, which can take the form of a flat fee. For this purpose we have designed a new auction mechanism that fairly distributes resources (or goods, e.g., slots) in online fashion, based on the users’ declared preferences, while being socially efficient. While the main motivation for this work was sponsored search, the proposed mechanism can be used in general for the fair distribution of resources in an online fashion among a set of users. Hence, we refer to this mechanism as Fair and Efficient Distribution of Resources (FEDoR). FEDoR can be used even when the auction is done in a distributed fashion (i.e., without central authority), and it provides fairness, social efficiency and incentive compatibility.
dc.language.isoeng
dc.titleA Mechanism for Fair Distribution of Resources with Application to Sponsored Searchen
dc.typeconference object
dc.conference.date14-17 December 2014
dc.conference.placeBeijing, China
dc.conference.titleThe 10th Conference on Web and Internet Economics (WINE 2014), The 11th Workshop on Algorithms and the Models of Web Graph (WAW 2014)*
dc.event.typeconference
dc.pres.typeposter
dc.type.hasVersionVoR
dc.rights.accessRightsopen access
dc.page.final5
dc.page.initial1
dc.description.refereedTRUE
dc.description.statuspub
dc.eprint.idhttp://eprints.networks.imdea.org/id/eprint/947


Files in this item

This item appears in the following Collection(s)

Show simple item record