Stars and celebrities: A network creation game
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/83229
Tipus de documentReport de recerca
Data publicació2015
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
ProjecteMODELOS Y METODOS COMPUTACIONALES PARA DATOS MASIVOS ESTRUCTURADOS (MINECO-TIN2013-46181-C2-1-R)
Abstract
Celebrity 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.
Descripció
CoRR
CitacióÁlvarez, C., Blesa, M., Duch, A., Messegué, A., Serna, M. "Stars and celebrities: A network creation game". 2015.
Forma partarXiv:1505.03718v2
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
1505.03718v2.pdf | 201,9Kb | Visualitza/Obre |