Mobile Network Creation Games

Flammini, Michele; Gallotti, Vasco; Melideo, Giovanna; Monaco, Gianpiero; Moscardelli, Luca

doi:10.1007/978-3-642-31104-8_14

Cited by 2 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In reachability models, e.g. [4,14,5,10,3,11], the service quality of an agent is simply defined as the number of reachable agents and distances are ignored completely. For reachability models the works of Kliemann [14,15] and the very recent paper by Goyal et al [11] explicitly incorporate a notion of network robustness in the utility function of every agent.…”

Section: Related Workmentioning

confidence: 99%

On Selfish Creation of Robust Networks

Chauhan

Lenzner

Melnichenko

et al. 2016

Algorithmic Game Theory

View full text Add to dashboard Cite

Robustness is one of the key properties of nowadays networks. However, robustness cannot be simply enforced by design or regulation since many important networks, most prominently the Internet, are not created and controlled by a central authority. Instead, Internet-like networks emerge from strategic decisions of many selfish agents. Interestingly, although lacking a coordinating authority, such naturally grown networks are surprisingly robust while at the same time having desirable properties like a small diameter. To investigate this phenomenon we present the first simple model for selfish network creation which explicitly incorporates agents striving for a central position in the network while at the same time protecting themselves against random edge-failure. We show that networks in our model are diverse and we prove the versatility of our model by adapting various properties and techniques from the nonrobust versions which we then use for establishing bounds on the Price of Anarchy. Moreover, we analyze the computational hardness of finding best possible strategies and investigate the game dynamics of our model.

show abstract