{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T04:11:06Z","timestamp":1751602266123,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":25,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"ANR","award":["ANR-16-CE40-0023"],"award-info":[{"award-number":["ANR-16-CE40-0023"]}]},{"name":"Project DESCARTES","award":["ANR-16-CE40-0023"],"award-info":[{"award-number":["ANR-16-CE40-0023"]}]},{"name":"LabEx Sciences Mathématiques de Paris (SMP)"},{"name":"CNRS LIA FILOFOCS"},{"name":"Inria","award":["Project GANG"],"award-info":[{"award-number":["Project GANG"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186122","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"559-568","source":"Crossref","is-referenced-by-count":6,"title":["Preferential Attachment as a Unique Equilibrium"],"prefix":"10.1145","author":[{"given":"Chen","family":"Avin","sequence":"first","affiliation":[{"name":"Ben Gurion University, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avi","family":"Cohen","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[{"name":"CNRS and University Paris Diderot, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zvi","family":"Lotker","sequence":"additional","affiliation":[{"name":"Ben Gurion University, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186122-1","doi-asserted-by":"crossref","unstructured":"Réka Albert and Albert-László Barabási. Statistical mechanics of complex networks. Reviews of modern physics, 74(1):47, 2002.","DOI":"10.1103\/RevModPhys.74.47"},{"key":"key-10.1145\/3178876.3186122-2","doi-asserted-by":"crossref","unstructured":"David Avis, Kazuo Iwama, and Daichi Paku. Verifying nash equilibria in pagerank games on undirected web graphs. In International Symposium on Algorithms and Computation, pages 415--424. Springer, 2011.","DOI":"10.1007\/978-3-642-25591-5_43"},{"key":"key-10.1145\/3178876.3186122-3","unstructured":"Albert-László Barabási. Network science. Cambridge university press, 2016."},{"key":"key-10.1145\/3178876.3186122-4","doi-asserted-by":"crossref","unstructured":"Béla Bollobás and Oliver Riordan. The diameter of a scale-free random graph. Combinatorica, 24(1):5--34, 2004.","DOI":"10.1007\/s00493-004-0002-2"},{"key":"key-10.1145\/3178876.3186122-5","doi-asserted-by":"crossref","unstructured":"Béla Bollobás, Oliver Riordan, Joel Spencer, Gábor Tusnády, et al. The degree sequence of a scale-free random graph process. Random Structures & Algorithms, 18(3):279--290, 2001.","DOI":"10.1002\/rsa.1009"},{"key":"key-10.1145\/3178876.3186122-6","doi-asserted-by":"crossref","unstructured":"Wei Chen, Shang-Hua Teng, Yajun Wang, and Yuan Zhou. On the alpha-sensitivity of nash equilibria in pagerank-based network reputation games. In FAW, pages 63--73. Springer, 2009.","DOI":"10.1007\/978-3-642-02270-8_9"},{"key":"key-10.1145\/3178876.3186122-7","doi-asserted-by":"crossref","unstructured":"Raissa M D'souza, Christian Borgs, Jennifer T Chayes, Noam Berger, and Robert D Kleinberg. Emergence of tempered preferential attachment from optimization. Proceedings of the National Academy of Sciences, 104(15):6112--6117, 2007.","DOI":"10.1073\/pnas.0606779104"},{"key":"key-10.1145\/3178876.3186122-8","doi-asserted-by":"crossref","unstructured":"Alex Fabrikant, Ankur Luthra, Elitza Maneva, Christos H Papadimitriou, and Scott Shenker. On a network creation game. In Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 347--351. ACM, 2003.","DOI":"10.1145\/872035.872088"},{"key":"key-10.1145\/3178876.3186122-9","unstructured":"John Hopcroft and Daniel Sheldon. Network reputation games. Technical report, 2008."},{"key":"key-10.1145\/3178876.3186122-10","unstructured":"Matthew O Jackson. The economics of social networks. In Proceedings of the 9th World Congress of the Econometric Society, vol. 1, pages 1--56. Cambridge University Press, 2006."},{"key":"key-10.1145\/3178876.3186122-11","doi-asserted-by":"crossref","unstructured":"Matthew O Jackson and Brian W Rogers. Meeting strangers and friends of friends: How random are social networks? The American economic review, 97(3):890--915, 2007.","DOI":"10.1257\/aer.97.3.890"},{"key":"key-10.1145\/3178876.3186122-12","doi-asserted-by":"crossref","unstructured":"Jon Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, and Andrew Tomkins. The web as a graph: measurements, models, and methods. Computing and combinatorics, pages 1--17, 1999.","DOI":"10.1007\/3-540-48686-0_1"},{"key":"key-10.1145\/3178876.3186122-13","doi-asserted-by":"crossref","unstructured":"Georgios Kouroupas, Evangelos Markakis, Christos Papadimitriou, Vasileios Rigas, and Martha Sideri. The web graph as an equilibrium. In International Symposium on Algorithmic Game Theory, pages 203--215. Springer, 2015.","DOI":"10.1007\/978-3-662-48433-3_16"},{"key":"key-10.1145\/3178876.3186122-14","doi-asserted-by":"crossref","unstructured":"Paul L Krapivsky and Sidney Redner. Organization of growing random networks. Physical Review E, 63(6):066123, 2001.","DOI":"10.1103\/PhysRevE.63.066123"},{"key":"key-10.1145\/3178876.3186122-15","doi-asserted-by":"crossref","unstructured":"Pavel L Krapivsky and Sidney Redner. Network growth by copying. Physical Review E, 71(3):036118, 2005.","DOI":"10.1103\/PhysRevE.71.036118"},{"key":"key-10.1145\/3178876.3186122-16","doi-asserted-by":"crossref","unstructured":"Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D Sivakumar, Andrew Tomkins, and Eli Upfal. Stochastic models for the web graph. In Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on, pages 57--65. IEEE, 2000.","DOI":"10.1109\/SFCS.2000.892065"},{"key":"key-10.1145\/3178876.3186122-17","unstructured":"David Asher Levin, Yuval Peres, and Elizabeth Lee Wilmer. Markov chains and mixing times. American Mathematical Soc."},{"key":"key-10.1145\/3178876.3186122-18","unstructured":"L. Lovász. Random walks on graphs: A survey. In Combinatorics, Paul ErdH os is eighty, Vol. 2 (Keszthely, 1993), volume 2 of Bolyai Soc. Math. Stud., pages 353--397. János Bolyai Math. Soc., Budapest, 1996."},{"key":"key-10.1145\/3178876.3186122-19","doi-asserted-by":"crossref","unstructured":"Eli A Meirom, Shie Mannor, and Ariel Orda. Network formation games with heterogeneous players and the internet structure. In Proceedings of the fifteenth ACM conference on Economics and computation, pages 735--752. ACM, 2014.","DOI":"10.1145\/2600057.2602862"},{"key":"key-10.1145\/3178876.3186122-20","doi-asserted-by":"crossref","unstructured":"Mark Newman. Networks: an introduction. Oxford university press, 2010.","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001"},{"key":"key-10.1145\/3178876.3186122-21","doi-asserted-by":"crossref","unstructured":"Mark EJ Newman. The structure and function of complex networks. SIAM review, 45(2):167--256, 2003.","DOI":"10.1137\/S003614450342480"},{"key":"key-10.1145\/3178876.3186122-22","doi-asserted-by":"crossref","unstructured":"Derek de Solla Price. A general theory of bibliometric and other cumulative advantage processes. Journal of the Association for Information Science and Technology, 27(5):292--306, 1976.","DOI":"10.1002\/asi.4630270505"},{"key":"key-10.1145\/3178876.3186122-23","unstructured":"Bruce Sagan. The symmetric group: representations, combinatorial algorithms, and symmetric functions, volume 203. Springer Science & Business Media, 2013."},{"key":"key-10.1145\/3178876.3186122-24","doi-asserted-by":"crossref","unstructured":"Remco Van Der Hofstad. Random graphs and complex networks, 2016.","DOI":"10.1017\/9781316779422"},{"key":"key-10.1145\/3178876.3186122-25","doi-asserted-by":"crossref","unstructured":"Alexei Vázquez. Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations. Physical Review E, 67(5):056104, 2003.","DOI":"10.1103\/PhysRevE.67.056104"}],"event":{"number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '18","name":"the 2018 World Wide Web Conference","start":{"date-parts":[[2018,4,23]]},"location":"Lyon, France","end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186122","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186122&ftid=1957495&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:25:45Z","timestamp":1751563545000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186122"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186122","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}