{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:58Z","timestamp":1750307038791,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T00:00:00Z","timestamp":1340582400000},"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":[[2012,6,25]]},"DOI":"10.1145\/2312005.2312053","type":"proceedings-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T13:31:21Z","timestamp":1340803881000},"page":"267-276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Hedonic clustering games"],"prefix":"10.1145","author":[{"given":"Moran","family":"Feldman","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liane","family":"Lewin-Eytan","sequence":"additional","affiliation":[{"name":"IBM, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph (Seffi)","family":"Naor","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2007.05.024"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209194"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003550000067"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00182-010-0237-7"},{"volume-title":"NIPS Workshop on Clustering Theory","year":"2009","author":"Blum A.","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.2001.0877"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301257"},{"key":"e_1_3_2_1_9_1","first-page":"524","volume-title":"Proceedings of FOCS","author":"Guruswami V.","year":"2003"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45198-3_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2307\/1912943"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_21"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1929237.1929253"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10841-9_62"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.2.180"},{"volume-title":"Thesis","year":"2007","author":"Hoefer M.","key":"e_1_3_2_1_18_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":". Koltsidas and F. N. Pavlidou. A game theoretic approach to clustering of ad-hoc and sensor networks. Telecommunication Systems 47(1--2):81--93 June 2011.  . Koltsidas and F. N. Pavlidou. A game theoretic approach to clustering of ad-hoc and sensor networks. Telecommunication Systems 47(1--2):81--93 June 2011.","DOI":"10.1007\/s11235-010-9303-5"},{"volume-title":"NIPS Workshop on Clustering Theory","year":"2009","key":"e_1_3_2_1_20_1"},{"key":"e_1_3_2_1_21_1","unstructured":"S. R. Bul\u00f2. A game-theoretic framework for similarity-based data clustering. Ph.D. Thesis Universit\u00e0 Ca' Foscari di Venezia 2009.  S. R. Bul\u00f2. A game-theoretic framework for similarity-based data clustering. Ph.D. Thesis Universit\u00e0 Ca' Foscari di Venezia 2009."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00021-1"},{"key":"e_1_3_2_1_23_1","unstructured":"V. Vazirani. Approximation Algorithms. Springer Verlag 2001.   V. Vazirani. Approximation Algorithms. Springer Verlag 2001."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"E. B. Yanovskaya. Equilibrium points in polymatrix games. (in Russion) Litovskii Matematicheskii Sbornik 8:381--384 1968.  E. B. Yanovskaya. Equilibrium points in polymatrix games. (in Russion) Litovskii Matematicheskii Sbornik 8:381--384 1968.","DOI":"10.15388\/LMJ.1968.20224"}],"event":{"name":"SPAA '12: 24th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Pittsburgh Pennsylvania USA","acronym":"SPAA '12"},"container-title":["Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312053","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2312005.2312053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:52Z","timestamp":1750238452000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2312005.2312053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,25]]},"references-count":24,"alternative-id":["10.1145\/2312005.2312053","10.1145\/2312005"],"URL":"https:\/\/doi.org\/10.1145\/2312005.2312053","relation":{},"subject":[],"published":{"date-parts":[[2012,6,25]]},"assertion":[{"value":"2012-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}