{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:07:48Z","timestamp":1755925668439,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642293436"},{"type":"electronic","value":"9783642293443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29344-3_36","type":"book-chapter","created":{"date-parts":[[2012,4,10]],"date-time":"2012-04-10T14:19:29Z","timestamp":1334067569000},"page":"420-432","source":"Crossref","is-referenced-by-count":13,"title":["Cache Me If You Can: Capacitated Selfish Replication Games"],"prefix":"10.1007","author":[{"given":"Ragavendran","family":"Gopalakrishnan","sequence":"first","affiliation":[]},{"given":"Dimitrios","family":"Kanoulas","sequence":"additional","affiliation":[]},{"given":"Naga Naresh","family":"Karuturi","sequence":"additional","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[]},{"given":"Ravi","family":"Sundaram","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Angel, E., Bampis, E., Pollatos, G.G., Zissimopoulos, V.: Optimal data placement on networks with constant number of clients. CoRR, abs\/1004.4420 (2010)"},{"key":"36_CR2","unstructured":"Arrow, K.: Social Choice and Individual Values. Yale University Press (1951)"},{"issue":"4","key":"36_CR3","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/080715421","volume":"38","author":"I.D. Baev","year":"2008","unstructured":"Baev, I.D., Rajaraman, R., Swamy, C.: Approximation algorithms for data placement problems. SIAM J. Comput.\u00a038(4), 1411\u20131429 (2008)","journal-title":"SIAM J. Comput."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Byers, J.W., Luby, M., Mitzenmacher, M., Rege, A.: A digital fountain approach to reliable distribution of bulk data. In: SIGCOMM 1998, pp. 56\u201367 (1998)","DOI":"10.1145\/285243.285258"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X., Teng, S.-H.: Settling the complexity of computing two-player Nash equilibria. Journal of the ACM (JACM)\u00a056(3) (2009)","DOI":"10.1145\/1516512.1516516"},{"key":"36_CR6","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: PODC, pp. 21\u201330 (2004)","DOI":"10.1145\/1011767.1011771"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: STOC ACM, pp. 71\u201378 (2006)","DOI":"10.1145\/1132516.1132527"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1007\/11600930_105","volume-title":"Internet and Network Economics","author":"N.R. Devanur","year":"2005","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: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 1046\u20131055. Springer, Heidelberg (2005)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Luthra, A., Maneva, E., Papadimitriou, C.H., Shenker, S.: On a network creation game. In: PODC, pp. 347\u2013351 (2003)","DOI":"10.1145\/872035.872088"},{"key":"36_CR10","unstructured":"Garey, M., Johnson, D.: Computers and intractability. Freeman Press (1979)"},{"issue":"5","key":"36_CR11","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1109\/JSAC.2006.872884","volume":"24","author":"M.X. 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 Journal on Selected Areas in Communications\u00a024(5), 1020\u20131033 (2006)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Gopalakrishnan, R., Kanoulas, D., Karuturi, N.N., Rangan, C.P., Rajaraman, R., Sundaram, R.: Cache me if you can: Capacitated selfish replication in networks. CoRR abs\/1007.2694 (2011)","DOI":"10.1007\/978-3-642-29344-3_36"},{"issue":"1","key":"36_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? Journal of Computer and System Sciences\u00a037(1), 79\u2013100 (1988)","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: STOC ACM, pp. 654\u2013663 (1997)","DOI":"10.1145\/258533.258660"},{"key":"36_CR15","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. Journal of Algorithms\u00a038, 260\u2013302 (2001)","journal-title":"Journal of Algorithms"},{"issue":"6","key":"36_CR16","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1109\/TKDE.2002.1047770","volume":"14","author":"M.R. Korupolu","year":"2002","unstructured":"Korupolu, M.R., Dahlin, M.: Coordinated placement and replacement for large-scale distributed caches. IEEE Trans. Knowl. Data Eng.\u00a014(6), 1317\u20131329 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"36_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-Case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"36_CR18","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":"12","key":"36_CR19","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.\u00a017(12), 1401\u20131413 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"11","key":"36_CR20","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.\u00a04(11), 1185\u20131204 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481"},{"issue":"3","key":"36_CR22","first-page":"498","volume":"48","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. JCSS\u00a048(3), 498\u2013532 (1994)","journal-title":"JCSS"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Pollatos, G.G., Telelis, O., Zissimopoulos, V.: On the social cost of distributed selfish content replication. Networking, 195\u2013206 (2008)","DOI":"10.1007\/978-3-540-79549-0_17"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Permanents, pfaffian orientations, and even directed circuits. Annals of Mathematics, 929\u2013975 (1999)","DOI":"10.2307\/121059"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Shokrollahi, A.: Raptor codes. IEEE Trans. Inf. Theory, 2551\u20132567 (2006)","DOI":"10.1109\/TIT.2006.874390"},{"key":"36_CR26","doi-asserted-by":"crossref","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)","DOI":"10.1109\/ICDCS.1999.776529"},{"key":"36_CR27","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 Transactions on Database Systems\u00a022, 255\u2013314 (1997)","journal-title":"ACM Transactions on Database Systems"},{"key":"36_CR28","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":["Lecture Notes in Computer Science","LATIN 2012: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29344-3_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:31:03Z","timestamp":1742927463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29344-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293436","9783642293443"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29344-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}