Publication:
Fair linking mechanisms for resource allocation with correlated player types

Simple item page
dc.affiliation.dptoUC3M. Departamento de Matemáticases
dc.affiliation.grupoinvUC3M. Grupo de Investigación: Interdisciplinar de Sistemas Complejos (GISC)es
dc.contributor.authorSantos, Agustín
dc.contributor.authorFernández Anta, Antonio
dc.contributor.authorCuesta, José A.
dc.contributor.authorLópez Fernández, Luis
dc.date.accessioned2015-07-15T09:10:47Z
dc.date.available2015-07-15T09:10:47Z
dc.date.issued2014-05
dc.descriptionProceeding of: Second International Conference,Networked Systems (NETYS 2014), took place 2014. May 15-17. in Marrakech, Morocco.en
dc.description.abstractResource allocation is one of the most relevant problems in the area of Mechanism Design for computing systems. Devising algorithms capable of providing efficient and fair allocation is the objective of many previous research efforts. Usually, the mechanisms they propose use payments in order to deal with selfishness. Since using payments is undesirable in some contexts, a family of mechanisms without payments is proposed in this paper. These mechanisms extend the Linking Mechanism of Jackson and Sonnenschein introducing a generic concept of fairness with correlated preferences. We prove that these mechanisms have good incentive, fairness, and efficiency properties. To conclude, we provide an algorithm, based on the mechanisms, that could be used in practical computing environments.en
dc.description.statusPublicado
dc.format.extent26
dc.format.mimetypeapplication/pdf
dc.identifier.bibliographicCitationInternational Conference on Networked Systems: NETYS 2014. Lecture Notes in Computer Science 8593 (2014) pp. 70-83en
dc.identifier.doihttps://doi.org/10.1007/978-3-319-09581-3_6
dc.identifier.isbn978-3-319-09580-6
dc.identifier.issn0010-485X (Print)
dc.identifier.issn1436-5057 (Online)
dc.identifier.publicationfirstpage70
dc.identifier.publicationlastpage83
dc.identifier.publicationtitleLecture Notes in Computer Scienceen
dc.identifier.publicationvolume8593
dc.identifier.urihttps://hdl.handle.net/10016/21425
dc.identifier.uxxiCC/0000022622
dc.language.isoeng
dc.publisherSpringeren
dc.relation.eventdate2014, May 15-17en
dc.relation.eventnumber2
dc.relation.eventplaceMarrakech (Morocco)en
dc.relation.eventtitleInternational Conference,Networked Systems (NETYS 2014)en
dc.relation.ispartofhttp://hdl.handle.net/10016/30554
dc.relation.ispartofseriesLecture Notes in Computer Scienceen
dc.relation.projectIDGobierno de España. FIS2011-22449/PRODIEVO
dc.rights© Springer-Verlagen
dc.rights.accessRightsopen access
dc.subject.ecienciaMatemáticases
dc.subject.otherComputer Communication Networksen
dc.subject.otherAlgorithm Analysis and Problem Complexityen
dc.subject.otherLinking mechanismen
dc.subject.otherFairnessen
dc.subject.otherResource allocationen
dc.titleFair linking mechanisms for resource allocation with correlated player typesen
dc.typeconference paper*
dc.type.hasVersionAM*
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
fair_LNCS_2014_ps.pdf
Size:
662.05 KB
Format:
Adobe Portable Document Format
Download
Collections
DM - GISC - Comunicaciones en Congresos y otros eventos
DM - GISC - Capítulos de Monografías