I. Abraham, D. Malkhi, and O. Dobzinski, LAND: stretch (1+) localityaware networks for DHTs, SIAM, pp.550-559, 2004.

E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler et al., The price of stability for network design with fair cost allocation, Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS '04, pp.295-304, 2004.

V. Bala and S. Goyal, A Noncooperative Model of Network Formation, Econometrica, vol.68, issue.5, pp.1181-1229, 2000.
DOI : 10.1111/1468-0262.00155

X. Bei, W. Chen, S. Teng, J. Zhang, and J. Zhu, Bounded budget betweenness centrality game for strategic network formations, Theoretical Computer Science, vol.412, issue.52, pp.7147-7168, 2011.
DOI : 10.1016/j.tcs.2011.09.028

URL : http://doi.org/10.1016/j.tcs.2011.09.028

D. Black, The theory of committees and elections, 1958.
DOI : 10.1007/978-94-009-4225-7

M. Cha, H. Haddadi, F. Benevenuto, and P. K. Gummadi, Measuring user influence in twitter: The million follower fallacy, 2010.

K. Clarkson, Nearest Neighbor Queries in Metric Spaces, Discrete & Computational Geometry, vol.22, issue.1, pp.63-93, 1999.
DOI : 10.1007/PL00009449

A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou, and S. Shenker, On a network creation game, Proceedings of the twenty-second annual symposium on Principles of distributed computing , PODC '03, pp.347-351, 2003.
DOI : 10.1145/872035.872088

A. Fabrikant, C. H. Papadimitriou, and K. Talwar, The complexity of pure Nash equilibria, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.604-612, 2004.
DOI : 10.1145/1007352.1007445

P. Fraigniaud, E. Lebhar, and L. Viennot, The Inframetric Model for the Internet, IEEE INFOCOM 2008, The 27th Conference on Computer Communications, pp.1085-1093, 2008.
DOI : 10.1109/INFOCOM.2008.163

URL : https://hal.archives-ouvertes.fr/inria-00471723

A. Gai, D. Lebedev, F. Mathieu, F. De-montgolfier, J. Reynier et al., Acyclic Preference Systems in P2P Networks, Proc. Euro-Par, 2007.
DOI : 10.1007/978-3-540-74466-5_88

URL : https://hal.archives-ouvertes.fr/inria-00143790

G. Giakkoupis, Tight Bounds for Rumor Spreading with Vertex Expansion, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pp.801-815, 2014.
DOI : 10.1137/1.9781611973402.59

URL : https://hal.archives-ouvertes.fr/hal-01097140

S. Har-peled and M. Mendel, Fast construction of nets in low dimensional metrics, and their applications, Symposium on Computational Geometry, pp.150-158, 2005.

T. H. Haveliwala, Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search, IEEE Transactions on Knowledge and Data Engineering, vol.15, issue.4, pp.784-796, 2003.
DOI : 10.1109/TKDE.2003.1208999

M. Jackson, The Economics of Social Networks, 2010.
DOI : 10.1017/CBO9781139052269.003

B. Jiang, N. Hegde, L. Massoulié, and D. Towsley, How to Optimally allocate your budget of attention in social networks, 2013 Proceedings IEEE INFOCOM, 2013.
DOI : 10.1109/INFCOM.2013.6567042

URL : https://hal.archives-ouvertes.fr/hal-00839599

D. R. Karger and M. , Finding nearest neighbors in growthrestricted metrics, pp.741-750, 2002.
DOI : 10.1145/509907.510013

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Kempe and J. M. Kleinberg, Maximizing the spread of influence through a social network, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.137-146, 2003.
DOI : 10.1145/956750.956769

N. Laoutaris, L. J. Poplawski, R. Rajaraman, R. Sundaram, and S. Teng, Bounded budget connection (BBC) games or how to make friends and influence people, on a budget, Proceedings of the twentyseventh ACM symposium on Principles of distributed computing, PODC '08, pp.165-174, 2008.

L. Massoulié and A. Twigg, Rate-optimal schemes for Peer-to-Peer live streaming, Performance Evaluation, vol.65, issue.11-12, pp.11-12804, 2008.
DOI : 10.1016/j.peva.2008.03.003

A. May, A. Chaintreau, N. Korula, and S. Lattanzi, Filter & follow: How social media foster content curation, The 2014 ACM International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS '14, pp.43-55, 2014.

D. Monderer and L. Shapley, Potential Games, Games and Economic Behavior, vol.14, issue.1, pp.124-143, 1996.
DOI : 10.1006/game.1996.0044

C. G. Plaxton, R. Rajaraman, and A. W. Richa, Accessing Nearby Copies of Replicated Objects in a Distributed Environment, Theory of Computing Systems, vol.32, issue.3, pp.241-280, 1999.
DOI : 10.1007/s002240000118

R. W. Rosenthal, A class of games possessing pure-strategy Nash equilibria, International Journal of Game Theory, vol.2, issue.1, pp.65-67, 1973.
DOI : 10.1007/BF01737559

T. Roughgarden, Potential functions and the inef???ciency of equilibria, Proceedings of the International Congress of Mathematicians (ICM), pp.1071-1094, 2006.
DOI : 10.4171/022-3/52

H. A. Simon, Designing organizations for an information rich world, Computers, communications, and the public interest, pp.37-72, 1971.