R. Albert and A. Barabási, Statistical mechanics of complex networks, Reviews of modern physics, vol.74, issue.1, p.47, 2002.

D. Avis, K. Iwama, and D. Paku, Verifying nash equilibria in pagerank games on undirected web graphs, International Symposium on Algorithms and Computation, pp.415-424, 2011.
DOI : 10.1007/978-3-642-25591-5_43
URL : http://cgm.cs.mcgill.ca/~avis/doc/avis/AIP11a.pdf

A. Barabási, Network science, 2016.

B. Bollobás and O. Riordan, The diameter of a scale-free random graph, Combinatorica, vol.24, issue.1, pp.5-34, 2004.

B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády, The degree sequence of a scale-free random graph process, Random Structures & Algorithms, vol.18, issue.3, pp.279-290, 2001.

W. Chen, . Shang-hua, Y. Teng, Y. Wang, and . Zhou, On the alphasensitivity of nash equilibria in pagerank-based network reputation games, FAW, pp.63-73, 2009.

C. Raissa-m-d'souza, J. T. Borgs, N. Chayes, R. Berger, and . Kleinberg, Emergence of tempered preferential attachment from optimization, Proceedings of the National Academy of Sciences, vol.104, issue.15, pp.6112-6117, 2007.

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, pp.347-351, 2003.
DOI : 10.1145/872035.872088

J. Hopcroft and D. Sheldon, Network reputation games, 2008.

. Matthew-o-jackson, The economics of social networks, Proceedings of the 9th World Congress of the Econometric Society, vol.1, pp.1-56, 2006.

O. Matthew, B. W. Jackson, and . Rogers, Meeting strangers and friends of friends: How random are social networks? The American economic review, vol.97, pp.890-915, 2007.

J. Kleinberg, R. Kumar, and P. Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. The web as a graph: measurements, models, and methods. Computing and combinatorics, pp.1-17, 1999.

G. Kouroupas, E. Markakis, C. Papadimitriou, V. Rigas, and M. Sideri, The web graph as an equilibrium, International Symposium on Algorithmic Game Theory, pp.203-215, 2015.
DOI : 10.1007/978-3-662-48433-3_16

L. Paul, S. Krapivsky, and . Redner, Organization of growing random networks, Physical Review E, vol.63, issue.6, p.66123, 2001.

L. Pavel, S. Krapivsky, and . Redner, Network growth by copying, Physical Review E, vol.71, issue.3, p.36118, 2005.

R. Kumar, P. Raghavan, . Sridhar-rajagopalan, A. Sivakumar, E. Tomkins et al., Stochastic models for the web graph, Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on, pp.57-65, 2000.
DOI : 10.1109/sfcs.2000.892065

D. Asher-levin, Y. Peres, and E. L. Wilmer, Markov chains and mixing times

L. Lovász, Random walks on graphs: A survey, Combinatorics, vol.2, pp.353-397, 1993.

, János Bolyai Math. Soc, 1996.

S. Eli-a-meirom, A. Mannor, and . Orda, Network formation games with heterogeneous players and the internet structure, Proceedings of the fifteenth ACM conference on Economics and computation, pp.735-752, 2014.

M. Newman, Networks: an introduction, 2010.

E. J. Mark and . Newman, The structure and function of complex networks, SIAM review, vol.45, issue.2, pp.167-256, 2003.

D. De and S. Price, A general theory of bibliometric and other cumulative advantage processes, Journal of the Association for Information Science and Technology, vol.27, issue.5, pp.292-306, 1976.

B. Sagan, The symmetric group: representations, combinatorial algorithms, and symmetric functions, vol.203, 2013.

, Remco Van Der Hofstad. Random graphs and complex networks, 2016.

A. Vázquez, Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations, Physical Review E, vol.67, issue.5, p.56104, 2003.