On a network creation game

By Alex Fabrikant, A. Luthra, Elitza N. Maneva, Christos H. Papadimitriou, Scott Shenker. ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2003

566 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Efficiency loss in a network resource allocation game: the case of elastic supply (2004, background): “Results have been obtained for routing [16]–[18], traffic networks [19], [20] and network design problems [21], [22].”
The price of stability for network design with fair cost allocation (2004, background): “Network creation games of a fairly different flavor — in which users correspond to nodes, and can build subsets of the edges incident to them — have been considered in [2, 7, 10].”
The complexity of pure Nash equilibria (2004, background): “The network creation games [4] are another example, and so are congestion games with subjective delays played on a network of parallel edges[14].”
A Survey of Link Prediction in Social Networks (2011, background): “The closest work is the local connection game proposed by Fabrikant et. al.[ 17 ].”
Overcoming free-riding behavior in peer-to-peer systems (2005, background): “…is the focus of this paper, rational behavior manifests itself in many other distributed system settings, including strategic network formation [Fabrikant et al., 2003; Christin and Chuang, 2005], sel.sh routing [Cole et al., 2003] and interconnection [Ferreira and Sirbu, 2005], congestion…”