{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T04:46:41Z","timestamp":1777524401774,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030108007","type":"print"},{"value":"9783030108014","type":"electronic"}],"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-10801-4_9","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"94-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Coalition Resilient Outcomes in Max k-Cut Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4189-6985","authenticated-orcid":false,"given":"Raffaello","family":"Carosi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3850-0786","authenticated-orcid":false,"given":"Simone","family":"Fioravanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6976-5579","authenticated-orcid":false,"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0998-5649","authenticated-orcid":false,"given":"Gianpiero","family":"Monaco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/s00182-016-0560-8","volume":"46","author":"KR Apt","year":"2017","unstructured":"Apt, K.R., de Keijzer, B., Rahn, M., Sch\u00e4fer, G., Simon, S.: Coordination games on graphs. Int. J. Game Theory 46(3), 851\u2013877 (2017). https:\/\/doi.org\/10.1007\/s00182-016-0560-8","journal-title":"Int. J. Game Theory"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"381","DOI":"10.2140\/pjm.1960.10.381","volume":"10","author":"RJ Aumann","year":"1960","unstructured":"Aumann, R.J.: Acceptable points in games of perfect information. Pac. J. Math. 10, 381\u2013417 (1960)","journal-title":"Pac. J. Math."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Savani, R.: Hedonic games. In: Handbook of Computational Social Choice, chapter 15. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.016"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G.: Locality-based network creation games. In: 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, pp. 277\u2013286 (2014)","DOI":"10.1145\/2612669.2612680"},{"key":"9_CR5","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. 62, 315\u2013371 (2018)","journal-title":"J. Artif. Intell."},{"key":"9_CR6","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, 201\u2013230 (2002). https:\/\/doi.org\/10.1006\/game.2001.0877","journal-title":"Games Econ. Behav."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Carosi, R., Fioravanti, S., Gual\u00e0, L., Monaco, G.: Coalition resilient outcomes in max $$k$$-cut games. CoRR, abs\/1810.09278 (2019)","DOI":"10.1007\/978-3-030-10801-4_9"},{"key":"9_CR8","unstructured":"Carosi, R., Flammini, M., Monaco, G.: Computing approximate pure nash equilibria in digraph k-coloring games. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS, pp. 911\u2013919 (2017)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-319-94776-1_23","volume-title":"Lecture Notes in Computer Science","author":"Raffaello Carosi","year":"2018","unstructured":"Carosi, R., Monaco, G.: Generalized graph k-coloring games. In: Proceedings of the 24th International Conference on Computing and Combinatorics, COCOON, pp. 268\u2013279 (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_23"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-662-48054-0_21","volume-title":"Mathematical Foundations of Computer Science 2015","author":"A Cord-Landwehr","year":"2015","unstructured":"Cord-Landwehr, A., Lenzner, P.: Network creation games: think global \u2013 act local. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 248\u2013260. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_21"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-662-47666-6_48","volume-title":"Automata, Languages, and Programming","author":"M Feldman","year":"2015","unstructured":"Feldman, M., Friedler, O.: A unified framework for strong price of anarchy in clustering games. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 601\u2013613. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_48"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-642-10841-9_62","volume-title":"Internet and Network Economics","author":"L Gourv\u00e8s","year":"2009","unstructured":"Gourv\u00e8s, L., Monnot, J.: On strong equilibria in the max cut game. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 608\u2013615. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_62"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-13562-0_22","volume-title":"Theory and Applications of Models of Computation","author":"L Gourv\u00e8s","year":"2010","unstructured":"Gourv\u00e8s, L., Monnot, J.: The max k-cut game and its strong equilibria. In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol. 6108, pp. 234\u2013246. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13562-0_22"},{"issue":"2","key":"9_CR14","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 nash equilibria in games with the lexicographical improvement property. Int. J. Game Theory 42(2), 461\u2013482 (2013). https:\/\/doi.org\/10.1007\/s00182-012-0322-1","journal-title":"Int. J. Game Theory"},{"key":"9_CR15","unstructured":"Hoefer, M.: Cost sharing and clustering under distributed competition. Ph.D. thesis, University of Konstanz (2007)"},{"key":"9_CR16","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"9_CR17","unstructured":"Kearns, M.J., Littman, M.L., Singh, S.P.: Graphical models for game theory. In: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, UAI, pp. 253\u2013260 (2001)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-41392-6_11","volume-title":"Algorithmic Game Theory","author":"J Kun","year":"2013","unstructured":"Kun, J., Powers, B., Reyzin, L.: Anti-coordination games and stable graph colorings. In: V\u00f6cking, B. (ed.) SAGT 2013. LNCS, vol. 8146, pp. 122\u2013133. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41392-6_11"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Sankowski, P.: Network formation games with local coalitions. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC, pp. 299\u2013305 (2007)","DOI":"10.1145\/1281100.1281143"},{"key":"9_CR20","unstructured":"Monaco, G., Moscardelli, L., Velaj, Y.: Stable outcomes in modified fractional hedonic games. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS, pp. 937\u2013945 (2018)"},{"key":"9_CR21","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"},{"issue":"1","key":"9_CR22","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0220004","volume":"20","author":"AA Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM J. Comput. 20(1), 56\u201387 (1991). https:\/\/doi.org\/10.1137\/0220004","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:16:08Z","timestamp":1709810168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"27 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","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":"92","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":"35","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":"6","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":"38% - 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":"3.3","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)"}}]}}