{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:52:09Z","timestamp":1743047529665,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030304720"},{"type":"electronic","value":"9783030304737"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30473-7_17","type":"book-chapter","created":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:02:36Z","timestamp":1568588556000},"page":"252-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On a Simple Hedonic Game with Graph-Restricted Communication"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, H., Savani, R.: Hedonic games. In: Handbook of Computational Social Choice, pp. 356\u2013376 (2016)","DOI":"10.1017\/CBO9781107446984.016"},{"key":"17_CR2","unstructured":"Aziz, H., Brandt, F., Seedig, H.G.: Stable partitions in additively separable hedonic games. In: Proceedings of AAMAS, pp. 183\u2013190 (2011)"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.geb.2003.10.003","volume":"49","author":"C Ballester","year":"2004","unstructured":"Ballester, C.: NP-completeness in hedonic games. Games Econ. Behav. 49(1), 1\u201330 (2004)","journal-title":"Games Econ. Behav."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Balliu, A., Flammini, M., Melideo, G., Olivetti, D.: Nash stability in social distance games. In: Proceedings of AAAI, pp. 342\u2013348 (2017)","DOI":"10.1609\/aaai.v31i1.10608"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Balliu, A., Flammini, M., Olivetti, D.: On Pareto optimality in social distance games. In: Proceedings of AAAI, pp. 349\u2013355 (2017)","DOI":"10.1609\/aaai.v31i1.10607"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s003550000067","volume":"18","author":"S Banerjee","year":"2001","unstructured":"Banerjee, S., Konishi, H., S\u00f6nmez, T.: Core in a simple coalition formation game. Soc. Choice Welf. 18(1), 135\u2013153 (2001)","journal-title":"Soc. Choice Welf."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1613\/jair.1.11211","volume":"62","author":"V Bil\u00f2","year":"2018","unstructured":"Bil\u00f2, V., Fanelli, A., Flammini, M., Monaco, G., Moscardelli, L.: Nash stable outcomes in fractional hedonic games: existence, efficiency and computation. J. Artif. Intell. Res. 62, 315\u2013371 (2018)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/game.2001.0877","volume":"38","author":"A Bogomolnaia","year":"2002","unstructured":"Bogomolnaia, A., Jackson, M.O.: The stability of hedonic coalition structures. Games Econ. Behav. 38(2), 201\u2013230 (2002)","journal-title":"Games Econ. Behav."},{"key":"17_CR9","unstructured":"Br\u00e2nzei, S., Larson, K.: Coalitional affinity games and the stability gap. In: Proceedings of IJCAI 2009, pp. 79\u201384 (2009)"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"71","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 71(3), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"17_CR11","first-page":"360","volume":"36","author":"ED Demaine","year":"2005","unstructured":"Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theor. Comput. Sci. 36(3), 360\u2013383 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.19.2.257","volume":"19","author":"X Deng","year":"1994","unstructured":"Deng, X., Papadimitriou, C.H.: On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2), 257\u2013266 (1994)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"987","DOI":"10.2307\/1912943","volume":"48","author":"JH Dr\u00e8ze","year":"1980","unstructured":"Dr\u00e8ze, J.H., Greenberg, J.: Hedonic coalitions: optimality and stability. Econometrica 48(4), 987\u20131003 (1980)","journal-title":"Econometrica"},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1080\/15427951.2012.709217","volume":"8","author":"B Escoffier","year":"2012","unstructured":"Escoffier, B., Gourv\u00e8s, L., Monnot, J.: Strategic coloring of a graph. Internet Math. 8(4), 424\u2013455 (2012)","journal-title":"Internet Math."},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2742345","volume":"2","author":"M Feldman","year":"2015","unstructured":"Feldman, M., Lewin-Eytan, L., Naor, J.: Hedonic clustering games. ACM Trans. Parallel Comput. 2(1), 1\u201348 (2015)","journal-title":"ACM Trans. Parallel Comput."},{"key":"17_CR16","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Online coalition structure generation in graph games. In: Proceedings of AAMAS, pp. 1353\u20131361 (2018)"},{"key":"17_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00182-012-0322-1","volume":"42","author":"T Harks","year":"2013","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.H.: Strong equilibria in games with the lexicographical improvement property. Int. J. Game Theor. 42(2), 461\u2013482 (2013)","journal-title":"Int. J. Game Theor."},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.artint.2018.06.004","volume":"262","author":"M Hoefer","year":"2018","unstructured":"Hoefer, M., Vaz, D., Wagner, L.: Dynamics in matching and coalition formation games with structural constraints. Artif. Intell. 262, 222\u2013247 (2018)","journal-title":"Artif. Intell."},{"key":"17_CR20","unstructured":"Igarashi, A., Elkind, E.: Hedonic games with graph-restricted communication. In: Proceedings of AAMAS, pp. 242\u2013250 (2016)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Monaco, G., Moscardelli, L., Velaj, Y.: Stable outcomes in modified fractional hedonic games. In: Proceedings of AAMAS, pp. 937\u2013945 (2018)","DOI":"10.1007\/s10458-019-09431-z"},{"key":"17_CR22","unstructured":"Monaco, G., Moscardelli, L., Velaj, Y.: On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare. In: Proceedings of AAMAS (to appear)"},{"issue":"23","key":"17_CR23","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.ipl.2012.08.016","volume":"112","author":"M Olsen","year":"2012","unstructured":"Olsen, M., Baekgaard, L., Tambo, T.: On non-trivial Nash stable partitions in additive hedonic games with symmetric 0\/1-utilities. Inf. Process. Lett. 112(23), 903\u2013907 (2012)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"17_CR24","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s00224-009-9176-8","volume":"45","author":"M Olsen","year":"2009","unstructured":"Olsen, M.: Nash stability in additively separable hedonic games and community structures. Theor. Comput. Syst. 45(4), 917\u2013925 (2009)","journal-title":"Theor. Comput. Syst."},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-92182-0_19","volume-title":"Algorithms and Computation","author":"PN Panagopoulou","year":"2008","unstructured":"Panagopoulou, P.N., Spirakis, P.G.: A game theoretic approach for efficient graph coloring. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 183\u2013195. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92182-0_19"},{"key":"17_CR26","unstructured":"Peters, D., Elkind, E.: Simple causes of complexity in hedonic games. In: Proceedings of AAAI, pp. 617\u2013623 (2015)"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Peters, D.: Graphical hedonic games of bounded treewidth. In: Proceedings of AAAI, pp. 586\u2013593 (2016)","DOI":"10.1609\/aaai.v30i1.10046"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30473-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:34:36Z","timestamp":1709811276000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30473-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304720","9783030304737"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30473-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/corelab.ntua.gr\/sagt2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}