{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:09Z","timestamp":1750308669451,"version":"3.41.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2012,10,8]],"date-time":"2012-10-08T00:00:00Z","timestamp":1349654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2012,10,8]]},"abstract":"<jats:p>Greedy navigability is a central issue in the theory of networks. However, the exogenous nature of network models do not allow for describing how greedy routable-networks emerge in reality. In turn, network formation games focus on the very emergence proess, but the applied shortest-path based cost functions exclude navigational aspects. This paper takes a frst step towards incorporating both emergence (missing in algorithmic network models) and greedy navigability (missing in network formation games) into a single framework, and proposes the Greedy Network Formation Game. Our first contribution is the game definition, where we assume a hidden metric space underneath the network, and, instead of usual shortest path metric, we use the length of greedy paths as the measure of communiation cost between players. Our main finding is that greedy-routable small worlds do not emerge on constant dimensional Eulidean grids. This simply means that the emergence of topologies on which w eunderstood the priniples of greedy forwarding cannot be explained endogenously. We also present a very brief outlook on how the situation hanges in the hyperbolic space.<\/jats:p>","DOI":"10.1145\/2381056.2381069","type":"journal-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T14:55:16Z","timestamp":1349967316000},"page":"49-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["On greedy network formation"],"prefix":"10.1145","volume":"40","author":[{"given":"Andr\u00e1s","family":"Guly\u00e1s","sequence":"first","affiliation":[{"name":"Budapest University of Technology and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Attila","family":"Kor\u00f6si","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00e1vid","family":"Szab\u00f3","sequence":"additional","affiliation":[{"name":"Budapest University of Technology and Economics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gergely","family":"Bicz\u00f3k","sequence":"additional","affiliation":[{"name":"Norwegian University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,10,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_2_1_2_1","volume-title":"Proc. of ICM","volume":"3","author":"Kleinberg J.","year":"2006","unstructured":"J. Kleinberg . Complex networks and decentralized search algorithms . In Proc. of ICM , volume 3 , 2006 . J. Kleinberg. Complex networks and decentralized search algorithms. In Proc. of ICM, volume 3, 2006."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.036106"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.221"},{"key":"e_1_2_1_5_1","unstructured":"A. Guly\u00e1s A. K\u00f6r\u00f6si D. Szab\u00f3 and G. Bicz\u00f3k. On greedy network formation. Technical report http:\/\/qosip.tmit.bme.hul\/~gulyas\/personal_page\/gg.pdf 2011.  A. Guly\u00e1s A. K\u00f6r\u00f6si D. Szab\u00f3 and G. Bicz\u00f3k. On greedy network formation. Technical report http:\/\/qosip.tmit.bme.hul\/~gulyas\/personal_page\/gg.pdf 2011."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248075"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.102.058701"},{"key":"e_1_2_1_8_1","volume-title":"Advanes in Neural Information Processing Systems, page 385","author":"Even-Darand E.","year":"2007","unstructured":"E. Even-Darand , M. Kearns . A small world threshold for eonomic network formation . In Advanes in Neural Information Processing Systems, page 385 , 2007 . E. Even-Darand, M. Kearns. A small world threshold for eonomic network formation. In Advanes in Neural Information Processing Systems, page 385, 2007."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.2307\/2786545"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1038\/35022643"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1070120"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms1063"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592577"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872088"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073833"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281142"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2381056.2381069","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2381056.2381069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:00:39Z","timestamp":1750276839000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2381056.2381069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,8]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,10,8]]}},"alternative-id":["10.1145\/2381056.2381069"],"URL":"https:\/\/doi.org\/10.1145\/2381056.2381069","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2012,10,8]]},"assertion":[{"value":"2012-10-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}