{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:37:36Z","timestamp":1743014256325,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030859466"},{"type":"electronic","value":"9783030859473"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85947-3_18","type":"book-chapter","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:45:22Z","timestamp":1631580322000},"page":"266-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1496-7434","authenticated-orcid":false,"given":"Michael","family":"McKay","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6754-7308","authenticated-orcid":false,"given":"David","family":"Manlove","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.ipl.2008.10.003","volume":"109","author":"E Arkin","year":"2009","unstructured":"Arkin, E., Bae, S., Efrat, A., Mitchell, J., Okamoto, K., Polishchuk, V.: Geometric stable roommates. Inf. Process. Lett. 109, 219\u2013224 (2009)","journal-title":"Inf. Process. Lett."},{"key":"18_CR2","unstructured":"Aziz, H., Brandt, F., Seedig, H.G.: Optimal partitions in additively separable hedonic games. In: Proceedings of IJCAI 2011: The 22nd International Joint Conference on Artificial Intelligence, vol. 1, pp. 43\u201348. AAAI Press (2011)"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.artint.2012.09.006","volume":"195","author":"H Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., Seedig, H.G.: Computing desirable partitions in additively separable hedonic games. Artif. Intell. 195, 316\u2013334 (2013)","journal-title":"Artif. Intell."},{"key":"18_CR4","unstructured":"Aziz, H., Gaspers, S., Gudmundsson, J., Mestre, J., T\u00e4ubig, H.: Welfare maximization in fractional hedonic games. In: Proceedings of IJCAI 2015: The 24th International Joint Conference on Artificial Intelligence, pp. 461\u2013467. AAAI Press (2015)"},{"key":"18_CR5","unstructured":"Aziz, H., Lang, J., Monnot, J.: Computing Pareto optimal committees. In: Proceedings of IJCAI 2016: The 25th International Joint Conference on Artificial Intelligence, pp. 60\u201366. AAAI Press (2016)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Aziz, H., Savani, R., Moulin, H.: Hedonic games. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice, pp. 356\u2013376. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.016"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Barber\u00e0, S., Bossert, W., Pattanaik, P.: Ranking sets of objects. In: Barber\u00e0, S., Hammond, P., Seidl, C. (eds.) Handbook of Utility Theory, vol. 2, chap. 17, pp. 893\u2013977. Kluwer Academic Publishers (2004)","DOI":"10.1007\/978-1-4020-7964-1_4"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Boehmer, N., Elkind, E.: Stable roommate problem with diversity preferences. In: Proceedings of IJCAI 2020: The 29th International Joint Conference on Artificial Intelligence, pp. 96\u2013102. IJCAI Organization (2020)","DOI":"10.24963\/ijcai.2020\/14"},{"key":"18_CR9","unstructured":"Brandt, F., Bullinger, M.: Finding and recognizing popular coalition structures. In: Proceedings of AAMAS 2020: The 19th International Conference on Autonomous Agents and Multiagent Systems, pp. 195\u2013203. IFAAMAS (2020)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-64946-3_5","volume-title":"Web and Internet Economics","author":"R Bredereck","year":"2020","unstructured":"Bredereck, R., Heeger, K., Knop, D., Niedermeier, R.: Multidimensional stable roommates with\u00a0master list. In: Chen, X., Gravin, N., Hoefer, M., Mehta, R. (eds.) WINE 2020. LNCS, vol. 12495, pp. 59\u201373. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64946-3_5"},{"key":"18_CR11","unstructured":"Bullinger, M.: Pareto-optimality in cardinal hedonic games. In: Proceedings of AAMAS 2020: The 19th International Conference on Autonomous Agents and Multiagent Systems, pp. 213\u2013221. IFAAMAS (2020)"},{"issue":"7","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1396","DOI":"10.1016\/j.dam.2008.10.017","volume":"157","author":"F Chataigner","year":"2009","unstructured":"Chataigner, F., Mani\u0107, G., Wakabayashi, Y., Yuster, R.: Approximation algorithms and hardness results for the clique packing problem. Discret. Appl. Math. 157(7), 1396\u20131406 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"18_CR13","first-page":"87","volume":"4","author":"\u00c1 Cseh","year":"2019","unstructured":"Cseh, \u00c1., Fleiner, T., Harj\u00e1n, P.: Pareto optimal coalitions of fixed size. J. Mech. Inst. Des. 4(1), 87\u2013108 (2019)","journal-title":"J. Mech. Inst. Des."},{"issue":"13","key":"18_CR14","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1016\/j.dam.2013.03.003","volume":"161","author":"VG Deineko","year":"2013","unstructured":"Deineko, V.G., Woeginger, G.J.: Two hardness results for core stability in hedonic coalition formation games. Discret. Appl. Math. 161(13), 1837\u20131842 (2013)","journal-title":"Discret. Appl. Math."},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.: College admissions and the stability of marriage. Amer. Math. Monthly 69, 9\u201315 (1962)","journal-title":"Amer. Math. Monthly"},{"key":"18_CR16","volume-title":"Computers and Intractability","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. Freeman, San Francisco (1979)"},{"issue":"4","key":"18_CR17","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1142\/S0219198906001144","volume":"8","author":"J Hajdukov\u00e1","year":"2006","unstructured":"Hajdukov\u00e1, J.: Coalition formation games: a survey. Int. Game Theory Rev. 8(4), 613\u2013641 (2006)","journal-title":"Int. Game Theory Rev."},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-540-75520-3_50","volume-title":"Algorithms \u2013 ESA 2007","author":"C-C Huang","year":"2007","unstructured":"Huang, C.-C.: Two\u2019s company, three\u2019s a crowd: stable family and threesome roommates problems. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 558\u2013569. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_50"},{"key":"18_CR19","unstructured":"Huang, C.-C.: Two\u2019s company, three\u2019s a crowd: stable family and threesome roommates problems. Computer Science Technical Report TR2007-598, Dartmouth College (2007)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Irving, R.: An efficient algorithm for the \u201cstable roommates\u201d problem. J. Algorithms 6, 577\u2013595 (1985)","DOI":"10.1016\/0196-6774(85)90033-1"},{"key":"18_CR21","unstructured":"Iwama, K., Miyazaki, S., Okamoto, K.: Stable roommates problem with triple rooms. In: Proceedings of WAAC 2007: The 10th Korea-Japan Workshop on Algorithms and Computation, pp. 105\u2013112 (2007)"},{"issue":"3","key":"18_CR22","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"DG Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G., Hell, P.: On the complexity of general graph factor problems. SIAM J. Comput. 12(3), 601\u2013609 (1983)","journal-title":"SIAM J. Comput."},{"key":"18_CR23","unstructured":"McKay, M., Manlove, D.: The three-dimensional stable roommates problem with additively separable preferences (preprint). arXiv:2107.04368 [cs.GT]"},{"issue":"2","key":"18_CR24","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/0404023","volume":"4","author":"C Ng","year":"1991","unstructured":"Ng, C., Hirschberg, D.: Three-dimensional stable matching problems. SIAM J. Discret. Math. 4(2), 245\u2013252 (1991)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"18_CR25","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.ejor.2009.09.004","volume":"203","author":"SC Sung","year":"2010","unstructured":"Sung, S.C., Dimitrov, D.: Computational complexity in additive hedonic games. Eur. J. Oper. Res. 203(3), 635\u2013639 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-35843-2_4","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"GJ Woeginger","year":"2013","unstructured":"Woeginger, G.J.: Core stability in hedonic coalition formation. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 33\u201350. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35843-2_4"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Wright, M., Vorobeychik, Y.: Mechanism design for team formation. In: Proceedings of the 29th Conference on Artificial Intelligence, AAAI 2015, pp. 1050\u20131056. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9326"}],"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-85947-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T03:38:23Z","timestamp":1673235503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85947-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859466","9783030859473"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85947-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 September 2021","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":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2021","order":10,"name":"conference_id","label":"Conference ID","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":"73","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":"36% - 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.5","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)"}},{"value":"4 abstracts of presented papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}