{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T02:08:05Z","timestamp":1791079685581,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,7,25]],"date-time":"2004-07-25T00:00:00Z","timestamp":1090713600000},"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":[],"published-print":{"date-parts":[[2004,7,25]]},"DOI":"10.1145\/1011767.1011771","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"21-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":101,"title":["Selfish caching in distributed systems"],"prefix":"10.1145","author":[{"given":"Byung-Gon","family":"Chun","sequence":"first","affiliation":[{"name":"University of California, Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kamalika","family":"Chaudhuri","sequence":"additional","affiliation":[{"name":"University of California, Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hoeteck","family":"Wee","sequence":"additional","affiliation":[{"name":"University of California, Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Barreno","sequence":"additional","affiliation":[{"name":"University of California, Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christos H.","family":"Papadimitriou","sequence":"additional","affiliation":[{"name":"University of California, Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Kubiatowicz","sequence":"additional","affiliation":[{"name":"University of California, Berkeley"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2004,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"http:\/\/www.mosek.com.  http:\/\/www.mosek.com."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060291"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780617"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/646867.706561"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502054"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00250-5"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/779928.779942"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/882459.882531"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007445"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_2_1_11_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman and Co. , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., 1979."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/989459.989467"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of ACM-SIAM SODA","author":"Goemans M. X.","year":"2000","unstructured":"M. X. Goemans and M. Skutella . Cooperative Facility Location Games . In Proc. of ACM-SIAM SODA , 2000 . M. X. Goemans and M. Skutella. Cooperative Facility Location Games. In Proc. of ACM-SIAM SODA, 2000."},{"key":"e_1_3_2_1_14_1","volume-title":"WebDB Workshop on Databases and the Web","author":"Gribble S.","year":"2001","unstructured":"S. Gribble What Can Databases Do for Peer-to-Peer ? In WebDB Workshop on Databases and the Web , June 2001 . S. Gribble et al. What Can Databases Do for Peer-to-Peer? In WebDB Workshop on Databases and the Web, June 2001."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945475"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571861"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796509"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832199"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916684"},{"key":"e_1_3_2_1_20_1","volume-title":"Self-stabilizing Protocol for Placement of Replicated Resources in Emerging Networks. In Proc. of IEEE ICNP","author":"Ko B.-J.","year":"2003","unstructured":"B.-J. Ko and D. Rubenstein . A Distributed , Self-stabilizing Protocol for Placement of Replicated Resources in Emerging Networks. In Proc. of IEEE ICNP , 2003 . B.-J. Ko and D. Rubenstein. A Distributed, Self-stabilizing Protocol for Placement of Replicated Resources in Emerging Networks. In Proc. of IEEE ICNP, 2003."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764944"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379239"},{"key":"e_1_3_2_1_23_1","volume-title":"Proc.of IEEE INFOCOM","author":"Li B.","year":"1999","unstructured":"B. Li , M. J. Golin , G. F. Italiano , and X. Deng . On the Optimal Placement of Web Proxies in the Internet . In Proc.of IEEE INFOCOM , 1999 . B. Li, M. J. Golin, G. F. Italiano, and X. Deng. On the Optimal Placement of Web Proxies in the Internet. In Proc.of IEEE INFOCOM, 1999."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/646689.703120"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796586"},{"key":"e_1_3_2_1_27_1","volume-title":"Discrete Location Theory","author":"Mirchandani P. B.","year":"1990","unstructured":"P. B. Mirchandani and R. L. Francis . Discrete Location Theory . Wiley-Interscience Series in Discrete Mathematics and Optimization, 1990 . P. B. Mirchandani and R. L. Francis. Discrete Location Theory. Wiley-Interscience Series in Discrete Mathematics and Optimization, 1990."},{"key":"e_1_3_2_1_28_1","volume-title":"A Course in Game Theory","author":"Osborne M. J.","year":"1994","unstructured":"M. J. Osborne and A. Rubinstein . A Course in Game Theory . MIT Press , 1994 . M. J. Osborne and A. Rubinstein. A Course in Game Theory. MIT Press, 1994."},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. of IEEE FOCS","author":"Pal M.","year":"2003","unstructured":"M. Pal and E. Tardos . Group Strategyproof Mechanisms via Primal-Dual Algorithms . In Proc. of IEEE FOCS , 2003 . M. Pal and E. Tardos. Group Strategyproof Mechanisms via Primal-Dual Algorithms. In Proc. of IEEE FOCS, 2003."},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. of IEEE INFOCOM","author":"Qiu L.","year":"2001","unstructured":"L. Qiu , V. N. Padmanabhan , and G. M. Voelker . On the Placement of Web Server Replicas . In Proc. of IEEE INFOCOM , 2001 . L. Qiu, V. N. Padmanabhan, and G. M. Voelker. On the Placement of Web Server Replicas. In Proc. of IEEE INFOCOM, 2001."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/876891.880582"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502053"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060292"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1009146"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652124"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1895868.1895900"}],"event":{"name":"PODC04: Principles of Distributed Computing 2004","location":"St. John's Newfoundland Canada","acronym":"PODC04","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011771","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1011767.1011771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:25:42Z","timestamp":1750281942000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011771"}},"subtitle":["a game-theoretic analysis"],"short-title":[],"issued":{"date-parts":[[2004,7,25]]},"references-count":35,"alternative-id":["10.1145\/1011767.1011771","10.1145\/1011767"],"URL":"https:\/\/doi.org\/10.1145\/1011767.1011771","relation":{},"subject":[],"published":{"date-parts":[[2004,7,25]]},"assertion":[{"value":"2004-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}