{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:53Z","timestamp":1740109433630,"version":"3.37.3"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0635119"],"award-info":[{"award-number":["CCF-0635119"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS- 0915985"],"award-info":[{"award-number":["CNS- 0915985"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s00224-019-09939-7","type":"journal-article","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T04:02:33Z","timestamp":1564372953000},"page":"272-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cache Me if You Can: Capacitated Selfish Replication Games in Networks"],"prefix":"10.1007","volume":"64","author":[{"given":"Ragavendran","family":"Gopalakrishnan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3684-1472","authenticated-orcid":false,"given":"Dimitrios","family":"Kanoulas","sequence":"additional","affiliation":[]},{"given":"Naga Naresh","family":"Karuturi","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[]},{"given":"Ravi","family":"Sundaram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,29]]},"reference":[{"key":"9939_CR1","doi-asserted-by":"publisher","unstructured":"Ahmadyan, S.N., Etesami, S.R., Poor, H.V.: A random tree search algorithm for Nash equilibrium in capacitated selfish replication games. In: IEEE 55th conference on decision and control (CDC), pp 4439\u20134444. https:\/\/doi.org\/10.1109\/CDC.2016.7798943 (2016)","DOI":"10.1109\/CDC.2016.7798943"},{"key":"9939_CR2","doi-asserted-by":"crossref","unstructured":"Angel, E., Bampis, E., Pollatos, G.G., Zissimopoulos, V.: Optimal data placement on networks with constant number of clients. Theoretical Computer Science (2013)","DOI":"10.1016\/j.tcs.2013.03.025"},{"key":"9939_CR3","unstructured":"Arrow, K.: Social choice and individual values. Yale University Press (1951)"},{"issue":"4","key":"9939_CR4","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/080715421","volume":"38","author":"ID Baev","year":"2008","unstructured":"Baev, I.D., Rajaraman, R., Swamy, C.: Approximation Algorithms for Data Placement Problems. SIAM J. Comput. 38(4), 1411\u20131429 (2008)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9939_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/285243.285258","volume":"28","author":"John W. Byers","year":"1998","unstructured":"Byers, J.W., Luby, M., Mitzenmacher, M., Rege, A.: A digital fountain approach to reliable distribution of bulk data. In: SIGCOMM \u201998, pp 56\u201367 (1998)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"issue":"3","key":"9939_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516516","volume":"56","author":"Xi Chen","year":"2009","unstructured":"Chen, X., Deng, X., Teng, S.H.: Settling the complexity of computing two-player Nash equilibria. Journal of the ACM (JACM), 56(3) (2009)","journal-title":"Journal of the ACM"},{"key":"9939_CR7","first-page":"282","volume-title":"Lecture Notes in Computer Science","author":"Yan Chen","year":"2002","unstructured":"Chen, Y., Katz, R.H., Kubiatowicz, J.D.: Scan: A dynamic, scalable, and efficient content distribution network. In: Mattern, F., Naghshineh, M. (eds.) Pervasive computing, pp 282\u2013296. Springer, Berlin (2002)"},{"key":"9939_CR8","doi-asserted-by":"crossref","unstructured":"Chun, B.G., Chaudhuri, K., Wee, H., Barreno, M., Papadimitriou, C.H., Kubiatowicz, J.: Selfish caching in distributed systems: A game-theoretic analysis. In: ACM symposium on principles of distributed computing (PODC), pp 21\u201330 (2004)","DOI":"10.1145\/1011767.1011771"},{"key":"9939_CR9","doi-asserted-by":"publisher","unstructured":"Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with cfs. In: Proceedings of the 8th ACM symposium on operating systems principles, SOSP \u201901. https:\/\/doi.org\/10.1145\/502034.502054 , pp 202\u2013215. ACM, New York (2001)","DOI":"10.1145\/502034.502054"},{"issue":"22-23","key":"9939_CR10","doi-asserted-by":"publisher","first-page":"2081","DOI":"10.1016\/S0169-7552(98)00250-5","volume":"30","author":"P Danzig","year":"1998","unstructured":"Danzig, P.: Netcache architecture and deployment. Comput. Netw. ISDN Syst. 30(22-23), 2081\u20132091 (1998). https:\/\/doi.org\/10.1016\/S0169-7552(98)00250-5","journal-title":"Comput. Netw. ISDN Syst."},{"key":"9939_CR11","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. STOC ACM, 71\u201378 (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"9939_CR12","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Garg, N., Khandekar, R., Pandit, V., Saberi, A., Vazirani, V.V.: Price of anarchy, locality gap, and a network service provider game. In: WINE, pp 1046\u20131055 (2005)","DOI":"10.1007\/11600930_105"},{"key":"9939_CR13","doi-asserted-by":"publisher","unstructured":"Douceur, J.R., Wattenhofer, R.P.: Large-scale simulation of replica placement algorithms for a serverless distributed file system. In: MASCOTS 2001 proceedings 9th international symposium on modeling, analysis and simulation of computer and telecommunication systems, pp. 311\u2013319. https:\/\/doi.org\/10.1109\/MASCOT.2001.948882 (2001)","DOI":"10.1109\/MASCOT.2001.948882"},{"key":"9939_CR14","unstructured":"Etesami, S.R., Basar, T.: Pure Nash equilibrium in capacitated selfish replication (CSR) game. arXiv: 1404.3442 (2014)"},{"key":"9939_CR15","doi-asserted-by":"crossref","unstructured":"Etesami, S.R., Basar, T.: Approximation algorithm for the binary-preference capacitated selfish replication game and a tight bound on its price of anarchy. arXiv: 1506.04047v2 (2016)","DOI":"10.1109\/CDC.2015.7402771"},{"key":"9939_CR16","unstructured":"Etesami, S.R., Basar, T.: Pure Nash equilibrium in a capacitated resource allocation game with binary preferences. arXiv: 1404.3442v3 (2016)"},{"issue":"99","key":"9939_CR17","first-page":"1","volume":"PP","author":"SR Etesami","year":"2016","unstructured":"Etesami, S.R., Basar, T.: Pure Nash equilibrium in a capacitated selfish resource allocation game. IEEE Transactions on Control of Network Systems PP(99), 1\u20131 (2016)","journal-title":"IEEE Transactions on Control of Network Systems"},{"key":"9939_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-27335-8_10-1","volume-title":"Network games","author":"SR Etesami","year":"2017","unstructured":"Etesami, S.R., Ba\u015far, T.: Network games, pp 1\u201346. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-27335-8_10-1"},{"key":"9939_CR19","doi-asserted-by":"publisher","unstructured":"Etesami, S.R., Ba\u015far, T.: An approximation algorithm and price of anarchy for the binary-preference capacitated selfish replication game. In: 54th IEEE conference on decision and control (CDC), pp. 3568\u20133573. https:\/\/doi.org\/10.1109\/CDC.2015.7402771 (2015)","DOI":"10.1109\/CDC.2015.7402771"},{"issue":"Supplement C","key":"9939_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.automatica.2016.10.002","volume":"76","author":"SR Etesami","year":"2017","unstructured":"Etesami, S.R., Ba\u015far, T.: Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game. Automatica 76(Supplement C), 153\u2013163 (2017). https:\/\/doi.org\/10.1016\/j.automatica.2016.10.002","journal-title":"Automatica"},{"key":"9939_CR21","doi-asserted-by":"publisher","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a Network Creation Game. In: PODC \u201903: Proceedings of the 22nd annual symposium on principles of distributed computing. https:\/\/doi.org\/10.1145\/872035.872088 , pp 347\u2013351. ACM Press, New York (2003)","DOI":"10.1145\/872035.872088"},{"key":"9939_CR22","doi-asserted-by":"publisher","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: A scalable wide-area web cache sharing protocol. In: Proceedings of the ACM SIGCOMM \u201998 conference on applications, technologies, architectures, and protocols for computer communication, SIGCOMM \u201998. https:\/\/doi.org\/10.1145\/285237.285287 , pp 254\u2013265. ACM, New York (1998)","DOI":"10.1145\/285237.285287"},{"issue":"4","key":"9939_CR23","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1120717.1120723","volume":"5","author":"M Feldman","year":"2005","unstructured":"Feldman, M., Chuang, J.: Overcoming free-riding behavior in peer-to-peer systems. ACM Sigecom Exchanges 5(4), 41\u201350 (2005)","journal-title":"ACM Sigecom Exchanges"},{"key":"9939_CR24","unstructured":"Fudenberg, D., Levine, D.: The theory of learning in games. MIT Press (1998)"},{"issue":"04","key":"9939_CR25","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1142\/S0129626403001574","volume":"13","author":"L Garces-Erice","year":"2003","unstructured":"Garces-Erice, L., Biersack, E.W., Felber, P.A., Ross, K.W., Urvoy-Keller, G.: Hierarchical peer-to-peer systems. Parallel Process. Lett. 13 (04), 643\u2013657 (2003). https:\/\/doi.org\/10.1142\/S0129626403001574","journal-title":"Parallel Process. Lett."},{"key":"9939_CR26","unstructured":"Garey, M., Johnson, D.: Computers and intractability. Freeman Press (1979)"},{"issue":"5","key":"9939_CR27","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1109\/JSAC.2006.872884","volume":"24","author":"MX Goemans","year":"2006","unstructured":"Goemans, M.X., Li, L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in ad hoc networks. IEEE J. Sel. Areas Commun. 24 (5), 1020\u20131033 (2006). https:\/\/doi.org\/10.1109\/JSAC.2006.872884","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"5","key":"9939_CR28","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1109\/JSAC.2006.872884","volume":"24","author":"MX Goemans","year":"2006","unstructured":"Goemans, M.X., Li, L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in Ad Hoc networks. IEEE J. Sel. Areas Commun. 24(5), 1020\u20131033 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9939_CR29","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-29344-3_36","volume-title":"LATIN 2012: Theoretical Informatics","author":"Ragavendran Gopalakrishnan","year":"2012","unstructured":"Gopalakrishnan, R., Kanoulas, D., Karuturi, N., Pandu Rangan, C., Rajaraman, R., Sundaram, R.: Cache me if you can: Capacitated selfish replication games. In: Latin American symposium on theoretical informatics (LATIN), vol. 7256, pp. 420-432 (2012)"},{"key":"9939_CR30","unstructured":"Gribble, S.D., Halevy, A.Y., Ives, Z.G., Rodrig, M., Suciu, D.: What can database do for peer-to-peer?. In: WebDB workshop on databases and the web (2001)"},{"key":"9939_CR31","doi-asserted-by":"publisher","unstructured":"Hu, X., Gong, J.: PhD forum: Not so cooperative caching. In: 21st IEEE international conference on network protocols (ICNP), pp. 1\u20133. https:\/\/doi.org\/10.1109\/ICNP.2013.6733656 (2013)","DOI":"10.1109\/ICNP.2013.6733656"},{"issue":"3","key":"9939_CR32","doi-asserted-by":"publisher","first-page":"351","DOI":"10.6138\/JIT.2014.15.3.04","volume":"15","author":"XY Hu","year":"2014","unstructured":"Hu, X.Y., Gong, J.: Study on the theoretical framework of not so cooperative caching. J. Internet Technol. 15(3), 351\u2013362 (2014). https:\/\/doi.org\/10.6138\/JIT.2014.15.3.04","journal-title":"J. Internet Technol."},{"key":"9939_CR33","doi-asserted-by":"crossref","unstructured":"Iyer, S., Rowstron, A.I.T., Druschel, P.: Squirrel: a decentralized peer-to-peer web cache. In: PODC (2002)","DOI":"10.1145\/571825.571861"},{"key":"9939_CR34","doi-asserted-by":"publisher","unstructured":"Jain, K., Vazirani, V.V.: Primal-dual approximation algorithms for metric facility location and k-median problems. In: 40th annual symposium on foundations of computer science (Cat. No.99CB37039), pp. 2\u201313. https:\/\/doi.org\/10.1109\/SFFCS.1999.814571 (1999)","DOI":"10.1109\/SFFCS.1999.814571"},{"key":"9939_CR35","doi-asserted-by":"publisher","unstructured":"Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., Zhang, L.: On the placement of internet instrumentation. In: Proceedings IEEE INFOCOM 2000. Conference on computer communications. 19th annual joint conference of the ieee computer and communications societies (Cat. No.00CH37064), vol. 1, pp. 295-304. https:\/\/doi.org\/10.1109\/INFCOM.2000.832199 (2000)","DOI":"10.1109\/INFCOM.2000.832199"},{"key":"9939_CR36","doi-asserted-by":"publisher","unstructured":"Jamin, S., Jin, C., Kurc, A.R., Raz, D., Shavitt, Y.: Constrained mirror placement on the internet. In: Proceedings IEEE INFOCOM 2001. Conference on computer communications. 20th annual joint conference of the ieee computer and communications society (Cat. No.01CH37213), vol. 1, pp. 31\u201340. https:\/\/doi.org\/10.1109\/INFCOM.2001.916684 (2001)","DOI":"10.1109\/INFCOM.2001.916684"},{"issue":"1","key":"9939_CR37","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"DS Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How Easy is Local Search? J. Comput. Syst. Sci. 37(1), 79\u2013100 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"9939_CR38","doi-asserted-by":"crossref","unstructured":"Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., Lewin, D.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: Proceedings of the 29th annual ACM symposium on theory of computing (STOC), pp. 654\u2013663 (1997)","DOI":"10.1145\/258533.258660"},{"key":"9939_CR39","doi-asserted-by":"crossref","unstructured":"Kintali, S., Poplawski, L.J., Rajaraman, R., Sundaram, R., Teng, S.H.: Reducibility among fractional stability problems. Proceedings of the 50th annual IEEE symposium on foundations of computer science (FOCS) (2009)","DOI":"10.1109\/FOCS.2009.57"},{"issue":"3","key":"9939_CR40","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/TNET.2005.850196","volume":"13","author":"BJ Ko","year":"2005","unstructured":"Ko, B.J., Rubenstein, D.: Distributed self-stabilizing placement of replicated resources in emerging networks. IEEE\/ACM Trans. Netw. 13(3), 476\u2013487 (2005). https:\/\/doi.org\/10.1109\/TNET.2005.850196","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9939_CR41","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1006\/jagm.2000.1129","volume":"38","author":"M Korupolu","year":"2001","unstructured":"Korupolu, M., Plaxton, C.G., Rajaraman, R.: Placement algorithms for hierarchical cooperative caching. J. Algorithms 38, 260\u2013302 (2001)","journal-title":"J. Algorithms"},{"issue":"6","key":"9939_CR42","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1109\/TKDE.2002.1047770","volume":"14","author":"MR Korupolu","year":"2002","unstructured":"Korupolu, M.R., Dahlin, M.: Coordinated placement and replacement for large-scale distributed caches. IEEE Trans. Knowl. Data Eng. 14(6), 1317\u20131329 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9939_CR43","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"Elias Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: STACS, pp. 404\u2013413 (1999)"},{"issue":"11","key":"9939_CR44","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/356989.357007","volume":"35","author":"J Kubiatowicz","year":"2000","unstructured":"Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. ACM SIGPLAN Not. 35(11), 190\u2013201 (2000). https:\/\/doi.org\/10.1145\/356989.357007","journal-title":"ACM SIGPLAN Not."},{"key":"9939_CR45","doi-asserted-by":"crossref","unstructured":"Laoutaris, N., Smaragdakis, G., Bestavros, A., Stavrakakis, I.: Mistreatment in distributed caching groups: Causes and implications. In: INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.131"},{"issue":"12","key":"9939_CR46","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1109\/TPDS.2006.171","volume":"17","author":"N Laoutaris","year":"2006","unstructured":"Laoutaris, N., Telelis, O., Zissimopoulos, V., Stavrakakis, I.: Distributed selfish replication. IEEE Trans. Parallel Distrib. Syst. 17(12), 1401\u20131413 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9939_CR47","doi-asserted-by":"crossref","unstructured":"Laoutaris, N., Smaragdakis, G., Oikonomou, K., Stavrakakis, I., Bestavros, A.: Distributed placement of service facilities in large-scale networks. In: INFOCOM, pp. 2144\u20132152 (2007)","DOI":"10.1109\/INFCOM.2007.248"},{"issue":"11","key":"9939_CR48","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1109\/71.250099","volume":"4","author":"A Leff","year":"1993","unstructured":"Leff, A., Wolf, J.L., Yu, P.S.: Replication algorithms in a remote caching architecture. IEEE Trans. Parallel Distrib. Syst. 4(11), 1185\u20131204 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9939_CR49","doi-asserted-by":"publisher","unstructured":"Li, B., Golin, M.J., Italiano, G.F., Deng, X., Sohraby, K.: On the optimal placement of web proxies in the internet. In: IEEE INFOCOM \u201999. Conference on computer communications. Proceedings. 18th annual joint conference of the IEEE computer and communications societies. The future is now (Cat. No.99CH36320), vol. 3, pp. 1282\u20131290. https:\/\/doi.org\/10.1109\/INFCOM.1999.752146 (1999)","DOI":"10.1109\/INFCOM.1999.752146"},{"key":"9939_CR50","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-45753-4_20","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"Mohammad Mahdian","year":"2002","unstructured":"Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K, Leonardi, S, Vazirani, V (eds.) Approximation algorithms for combinatorial optimization, pp 229\u2013242. Springer, Berlin (2002)"},{"key":"9939_CR51","doi-asserted-by":"crossref","unstructured":"McCuaig, W., Robertson, N., Seymour, P.D., Thomas, R.: Permanents, Pfaffian orientations, and even directed circuits. In: STOC, pp. 402\u2013405 (1997)","DOI":"10.1145\/258533.258625"},{"key":"9939_CR52","unstructured":"Mettu, R.R., Plaxton, C.G.: The online median problem. In: Proceedings of the 41st annual symposium on foundations of computer science. FOCS \u201900, p 339. IEEE Computer Society, Washington (2000)"},{"key":"9939_CR53","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani VV: Algorithmic game theory. Cambridge University Press, Cambridge (2007)"},{"key":"9939_CR54","unstructured":"Osborne, M.J., Rubinstein, A.: A course in game theory. MIT Press (1994)"},{"key":"9939_CR55","volume-title":"Resource allocation in operator-owned content delivery systems","author":"V Pacifici","year":"2016","unstructured":"Pacifici, V.: Resource allocation in operator-owned content delivery systems. KTH School of Electrical Engineering, PhD thesis (2016)"},{"issue":"3","key":"9939_CR56","first-page":"498","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. JCSS 48(3), 498\u2013532 (1994)","journal-title":"JCSS"},{"key":"9939_CR57","doi-asserted-by":"crossref","unstructured":"Pollatos, G.G., Telelis, O., Zissimopoulos, V.: On the social cost of distributed selfish content replication. In: Networking, pp. 195\u2013206 (2008)","DOI":"10.1007\/978-3-540-79549-0_17"},{"key":"9939_CR58","doi-asserted-by":"publisher","unstructured":"Qiu, L., Padmanabhan, V.N., Voelker, G.M.: On the placement of web server replicas. In: Proceedings IEEE INFOCOM 2001. Conference on computer communications. 20th annual joint conference of the IEEE computer and communications society (Cat. No.01CH37213), vol. 3, pp. 1587-1596. https:\/\/doi.org\/10.1109\/INFCOM.2001.916655 (2001)","DOI":"10.1109\/INFCOM.2001.916655"},{"key":"9939_CR59","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M Rabin","year":"1989","unstructured":"Rabin, M.: Efficient dispersal of information for security, load balancing and fault tolerance. J. ACM 36, 335\u2013348 (1989)","journal-title":"J. ACM"},{"key":"9939_CR60","doi-asserted-by":"publisher","unstructured":"Rabinovich, M., Rabinovich, I., Rajaraman, R., Aggarwal, A.: A dynamic object replication and migration protocol for an internet hosting service. In: Proceedings. 19th IEEE international conference on distributed computing systems (Cat. No.99CB37003), pp. 101\u2013113. https:\/\/doi.org\/10.1109\/ICDCS.1999.776511 (1999)","DOI":"10.1109\/ICDCS.1999.776511"},{"issue":"3","key":"9939_CR61","doi-asserted-by":"publisher","first-page":"929","DOI":"10.2307\/121059","volume":"150","author":"Neil Robertson","year":"1999","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Permanents, Pfaffian orientations, and even directed circuits. Annals of Mathematics, pp. 929\u2013975 (1999)","journal-title":"The Annals of Mathematics"},{"issue":"2","key":"9939_CR62","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1002\/net.3230240212","volume":"24","author":"Moshe B. Rosenwein","year":"1994","unstructured":"Rosenwein, M.B.: Discrete location theory. In: Mirchandani, P.B., Francis, R.L. (eds.) . Networks 24(2):124\u2013125 https:\/\/doi.org\/10.1002\/net.3230240212 , p 555. Wiley, New York (1990)","journal-title":"Networks"},{"key":"9939_CR63","doi-asserted-by":"publisher","unstructured":"Rowstron, A., Druschel, P.: Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In: Proceedings of the 18th ACM symposium on operating systems principles, SOSP \u201901. https:\/\/doi.org\/10.1145\/502034.502053 , pp 188\u2013201. ACM, New York (2001)","DOI":"10.1145\/502034.502053"},{"issue":"SI","key":"9939_CR64","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/844128.844131","volume":"36","author":"Y Saito","year":"2002","unstructured":"Saito, Y., Karamanolis, C., Karlsson, M., Mahalingam, M.: Taming aggressive replication in the pangaea wide-area file system. SIGOPS Oper. Syst. Rev. 36(SI), 15\u201330 (2002). https:\/\/doi.org\/10.1145\/844128.844131","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"9939_CR65","volume-title":"Combinatorial optimization (3 Vol.)","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization (3 Vol.) Springer-Verlag, Berlin (2003)"},{"issue":"6","key":"9939_CR66","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A. Shokrollahi","year":"2006","unstructured":"Shokrollahi, A.: Raptor codes. In: IEEE Trans Inf Theory, pp. 2551\u20132567 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"9939_CR67","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TC.2002.1009146","volume":"51","author":"X Tang","year":"2002","unstructured":"Tang, X., Chanson, S.T.: Coordinated en-route web caching. IEEE Trans. Comput. 51(6), 595\u2013607 (2002). https:\/\/doi.org\/10.1109\/TC.2002.1009146","journal-title":"IEEE Trans. Comput."},{"key":"9939_CR68","unstructured":"Tewari, R., Dahlin, M., Vin, H.M., Kay, J.S.: Design Considerations for Distributed Caching on the Internet. In: ICDCS, pp 273\u2013284 (1999)"},{"key":"9939_CR69","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-92185-1_29","volume-title":"Lecture Notes in Computer Science","author":"Haralampos Tsaknakis","year":"2008","unstructured":"Tsaknakis, H., Spirakis, P.G., Kanoulas, D.: Performance evaluation of a descent algorithm for bi-matrix games. In: Internet and network economics, 4th international workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings, pp 222\u2013230. https:\/\/doi.org\/10.1007\/978-3-540-92185-1_29 (2008)"},{"key":"9939_CR70","unstructured":"Vetta, A.: Nash equilibria in competitive societies, with applications to facility location traffic routing and auctions. In: FOCS (2002)"},{"key":"9939_CR71","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/249978.249982","volume":"22","author":"O Wolfson","year":"1997","unstructured":"Wolfson, O., Jajodia, S., Huang, Y.: An Adaptive Data Replication Algorithm. ACM Trans. Database Syst. 22, 255\u2013314 (1997)","journal-title":"ACM Trans. Database Syst."},{"key":"9939_CR72","unstructured":"Younger, D.H.: Graphs with interlinked directed circuits. In: Proceedings of midwestern symposium on circuit theory, vol. 2, pp. XVI2.1\u2013XVI2.7 (1973)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-019-09939-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-019-09939-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-019-09939-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T19:19:36Z","timestamp":1664047176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-019-09939-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,29]]},"references-count":72,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["9939"],"URL":"https:\/\/doi.org\/10.1007\/s00224-019-09939-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2019,7,29]]},"assertion":[{"value":"29 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}