Show simple item record

dc.contributor.authorÁlvarez Faura, M. del Carme
dc.contributor.authorBlesa Aguilera, Maria Josep
dc.contributor.authorDuch Brown, Amalia
dc.contributor.authorMessegué Buisan, Arnau
dc.contributor.authorSerna Iglesias, María José
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-02-22T09:39:41Z
dc.date.available2016-02-22T09:39:41Z
dc.date.issued2015
dc.identifier.citationÁlvarez, C., Blesa, M., Duch, A., Messegué, A., Serna, M. "Stars and celebrities: A network creation game". 2015.
dc.identifier.urihttp://hdl.handle.net/2117/83229
dc.descriptionCoRR
dc.description.abstractCelebrity games, a new model of network creation games is introduced. The specific features of this model are that players have different celebrity weights and that a critical distance is taken into consideration. The aim of any player is to be close (at distance less than critical) to the others, mainly to those with high celebrity weights. The cost of each player depends on the cost of establishing direct links to other players and on the sum of the weights of those players at a distance greater than the critical distance. We show that celebrity games always have pure Nash equilibria and we characterize the family of subgames having connected Nash equilibria, the so called star celebrity games. Exact bounds for the PoA of non star celebrity games and a bound of O(n/ß+ß) for star celebrity games are provided. The upper bound on the PoA can be tightened when restricted to particular classes of Nash equilibria graphs. We show that the upper bound is O(n/ß) in the case of 2-edge-connected graphs and 2 in the case of trees.
dc.format.extent19 p.
dc.language.isoeng
dc.relation.ispartofseriesarXiv:1505.03718v2
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.lcshGraph theory
dc.subject.lcshSocial networks
dc.subject.otherNetwork Creation Games
dc.titleStars and celebrities: A network creation game
dc.typeExternal research report
dc.subject.lemacGrafs, Teoria de
dc.subject.lemacXarxes socials
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
local.identifier.drac17510185
dc.description.versionPreprint
dc.relation.projectidinfo:eu-repo/grantAgreement/MINECO//TIN2013-46181-C2-1-R/ES/MODELOS Y METODOS COMPUTACIONALES PARA DATOS MASIVOS ESTRUCTURADOS/
dc.relation.projectidinfo:eu-repo/grantAgreement/AGAUR/V PRI 2010-2013/2014SGR1034
local.citation.authorÁlvarez, C.; Blesa, M.; Duch, A.; Messegué, A.; Serna, M.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record