{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:06Z","timestamp":1759637826189,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,3,4]],"date-time":"2010-03-04T00:00:00Z","timestamp":1267660800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s00453-010-9398-9","type":"journal-article","created":{"date-parts":[[2010,3,3]],"date-time":"2010-03-03T16:31:02Z","timestamp":1267633862000},"page":"419-446","source":"Crossref","is-referenced-by-count":8,"title":["Topological Implications of Selfish Neighbor Selection in Unstructured Peer-to-Peer Networks"],"prefix":"10.1007","volume":"61","author":[{"given":"Thomas","family":"Moscibroda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,4]]},"reference":[{"key":"9398_CR1","unstructured":"Abraham, I., Malkhi, D., Dobzinski, O.: LAND: Stretch (1+e) locality aware networks for DHTs. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 550\u2013559 (2004)"},{"key":"9398_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., Badola, A., Bickson, D., Malkhi, D., Maloo, S., Ron, S.: Practical locality-awareness for large scale information sharing. In: Proc. 4th Int. Workshop on Peer-to-Peer Systems (IPTPS) (2005)","DOI":"10.1007\/11558989_16"},{"key":"9398_CR3","doi-asserted-by":"crossref","unstructured":"Adar, E., Huberman, B.A.: Free riding on Gnutella. First Monday 5(10) (2000)","DOI":"10.5210\/fm.v5i10.792"},{"key":"9398_CR4","doi-asserted-by":"crossref","unstructured":"Albers, S., Eilts, S., Even-Dar, E., Mansour, Y., Roditty, L.: On Nash equilibria for a network creation game. In: Proc. 17th ACM Symposium on Discrete Algorithms (SODA) (2006)","DOI":"10.1145\/1109557.1109568"},{"key":"9398_CR5","doi-asserted-by":"crossref","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. 45th Symposium on Foundations of Computer Science (FOCS), pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"9398_CR6","unstructured":"Austen, I.: Like a swerving commuter, a selfish router slows traffic. The New York Times (2003)"},{"issue":"4489","key":"9398_CR7","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1126\/science.7466396","volume":"211","author":"R. Axelrod","year":"1981","unstructured":"Axelrod, R.: The evolution of cooperation. Science 211(4489), 1390\u20131396 (1981)","journal-title":"Science"},{"key":"9398_CR8","doi-asserted-by":"crossref","unstructured":"Bharambe, A.R., Herley, C., Padmanabhan, V.N.: Analyzing and improving a BitTorrent network\u2019s performance mechanisms. In: Proc. IEEE Conference on Computer Communications (INFOCOM), pp. 36\u201346 (2006)","DOI":"10.1109\/INFOCOM.2006.328"},{"key":"9398_CR9","unstructured":"Chan, H.T.-H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. In: Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 762\u2013771 (2005)"},{"key":"9398_CR10","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Roughgarden, T.: Network design with weighted players. In: Proc. 18th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 29\u201338 (2006)","DOI":"10.1145\/1148109.1148114"},{"key":"9398_CR11","unstructured":"Cohen, B.: Incentives build robustness in BitTorrent. In: Proc. 1st Workshop on Economics of Peer-to-Peer Systems (P2PEcon) (2003)"},{"issue":"3","key":"9398_CR12","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/j.jcss.2005.09.010","volume":"72","author":"R. Cole","year":"2006","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? J. Comput. Syst. Sci. 72(3), 444\u2013467 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"9398_CR13","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proc. 3rd ACM Symposium on Theory of Computing (STOC), pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"9398_CR14","doi-asserted-by":"crossref","unstructured":"Corbo, J., Parkes, D.C.: The price of selfish behavior in bilateral network formation. In: Proc. 24th ACM Symposium on Principles of Distributed Computing (PODC), pp. 99\u2013107 (2005)","DOI":"10.1145\/1073814.1073833"},{"key":"9398_CR15","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Mahini, H., Zadimoghaddam, M.: On the topologies formed by selfish peers. In: Proc. 26th Annual Symposium on Principles of Distributed Computing (PODC) (2007)"},{"key":"9398_CR16","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Mahini, H., Zadimoghaddam, M.: The price of anarchy in cooperative network creation games. In: Proc. 26th International Symposium on Theoretical Aspects of Computer Science (STACS) (2009)","DOI":"10.1145\/1980522.1980524"},{"key":"9398_CR17","doi-asserted-by":"crossref","unstructured":"Eidenbenz, S., Kumar, V., Zust, S.: Equilibria in topology control games for ad hoc networks. In: Proc. ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC) (2003)","DOI":"10.1145\/941079.941081"},{"key":"9398_CR18","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"9398_CR19","doi-asserted-by":"crossref","unstructured":"Feldman, M., Chuang, J.: Overcoming free-riding behavior in peer-to-peer systems. ACM Sigecom Exch. 6 (2005)","DOI":"10.1145\/1120717.1120723"},{"key":"9398_CR20","doi-asserted-by":"crossref","unstructured":"Ganesan, P., Seshadri, M.: On cooperative content distribution and the price of barter. In: Proc. 25th IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 81\u201390 (2005)","DOI":"10.1109\/ICDCS.2005.53"},{"key":"9398_CR21","unstructured":"Garcia, F.D., Hoepman, J.-H.: Off-line karma: A decentralized currency for peer-to-peer and grid applications. In: Proc. 3rd Applied Cryptography and Network Security (ACNS)"},{"key":"9398_CR22","unstructured":"Grolimund, D., Meisser, L., Schmid, S., Wattenhofer, R.: Havelaar: A robust and efficient reputation system for active peer-to-peer systems. In: Proc. 1st Workshop on the Economics of Networked Systems (NetEcon), June 2006"},{"key":"9398_CR23","doi-asserted-by":"crossref","unstructured":"Hughes, D., Coulson, G., Walkerdine, J.: Free riding on Gnutella revisited: The bell tolls? IEEE Distrib. Syst. Online 6(6) (2005)","DOI":"10.1109\/MDSO.2005.31"},{"key":"9398_CR24","doi-asserted-by":"crossref","unstructured":"Jun, S., Ahamad, M.: Incentives in BitTorrent induce free riding. In: Proc. 3rd ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems (P2PEcon) (2005)","DOI":"10.1145\/1080192.1080199"},{"key":"9398_CR25","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: Proc. 34th ACM Symposium on Theory of Computing (STOC), pp. 741\u2013750 (2002)","DOI":"10.1145\/510008.510013"},{"key":"9398_CR26","unstructured":"Locher, T., Moor, P., Schmid, S., Wattenhofer, R.: Free riding in BitTorrent is cheap. In: Proc. 5th Workshop on Hot Topics in Networks (HotNets) (2006)"},{"key":"9398_CR27","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Schmid, S., Wattenhofer, R.: On the topologies formed by selfish peers. In: Proc. 5th International Workshop on Peer-to-Peer Systems (IPTPS) (2006)","DOI":"10.1145\/1146381.1146403"},{"key":"9398_CR28","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Schmid, S., Wattenhofer, R.: On the topologies formed by selfish peers. In: Proc. 25th Annual Symposium on Principles of Distributed Computing (PODC) (2006)","DOI":"10.1145\/1146381.1146403"},{"key":"9398_CR29","doi-asserted-by":"crossref","unstructured":"Odlyzko, A.M.: The case against micropayments. In: Financial Cryptography, pp. 77\u201383 (2003)","DOI":"10.1007\/978-3-540-45126-6_6"},{"key":"9398_CR30","volume-title":"A Course in Game Theory","author":"M. Osborne","year":"2000","unstructured":"Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (2000)"},{"key":"9398_CR31","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the Internet. In: Proc. 33rd ACM Symposium on Theory of Computing (STOC), pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"9398_CR32","doi-asserted-by":"crossref","unstructured":"Plaxton, C., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proc. 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 311\u2013320 (1997)","DOI":"10.1145\/258492.258523"},{"key":"9398_CR33","doi-asserted-by":"crossref","unstructured":"Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-like peer-to-peer systems. In: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2004)","DOI":"10.1145\/1015467.1015508"},{"key":"9398_CR34","volume-title":"Selfish Routing and the Price of Anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"},{"key":"9398_CR35","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? J. ACM 49(2) (2002)","DOI":"10.1145\/506147.506153"},{"key":"9398_CR36","doi-asserted-by":"crossref","unstructured":"Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proc. IFIP\/ACM Int. Conference on Distributed Systems Platforms (Middleware), pp. 329\u2013350 (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"9398_CR37","doi-asserted-by":"crossref","unstructured":"Sanghavi, S., Hajek, B.: A new mechanism for the free-rider problem. In: Proc. 3rd ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems (P2PEcon) (2005)","DOI":"10.1145\/1080192.1080200"},{"key":"9398_CR38","doi-asserted-by":"crossref","unstructured":"Shneidman, J., Parkes, D.C.: Rationality and self-interest in peer to peer networks. In: Proc. 2nd Int. Workshop on Peer-to-Peer Systems (IPTPS) (2003)","DOI":"10.1007\/978-3-540-45172-3_13"},{"key":"9398_CR39","unstructured":"Tamilmani, K., Pai, V., Mohr, A.: SWIFT: A system with incentives for trading. In: Proc. 2nd Workshop on Economics of Peer-to-Peer Systems (P2PEcon) (2004)"},{"key":"9398_CR40","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C.A. Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8, 85\u201389 (1984)","journal-title":"Discrete Appl. Math."},{"key":"9398_CR41","unstructured":"Vishnumurthy, V., Chandrakumar, S., Sirer, E.G.: KARMA: A secure economic framework for P2P resource sharing. In: Proc. 1st Workshop on Economics of Peer-to-Peer Systems (P2PEcon) (2003)"},{"key":"9398_CR42","unstructured":"Wang, W., Li, B.: Market-driven bandwidth allocation in selfish overlay networks. In: Proc. IEEE Conference on Computer Communications (INFOCOM), pp. 36\u201346 (2005)"},{"key":"9398_CR43","doi-asserted-by":"crossref","unstructured":"Wong, B., Slivkins, A., Sirer, E.G.: Meridian: A lightweight network location service without virtual coordinates. In: Proc. ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2005)","DOI":"10.1145\/1080091.1080103"},{"key":"9398_CR44","doi-asserted-by":"crossref","unstructured":"Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A resilient global-scale overlay for service deployment. IEEE J. Sel. Areas Commun. (2003)","DOI":"10.1109\/JSAC.2003.818784"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9398-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9398-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9398-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:47:20Z","timestamp":1739922440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9398-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,4]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9398"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9398-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2010,3,4]]}}}