{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T22:10:35Z","timestamp":1775599835460,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030649456","type":"print"},{"value":"9783030649463","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_5","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"59-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Multidimensional Stable Roommates with\u00a0Master List"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6303-6276","authenticated-orcid":false,"given":"Robert","family":"Bredereck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8779-0890","authenticated-orcid":false,"given":"Klaus","family":"Heeger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2588-5709","authenticated-orcid":false,"given":"Du\u0161an","family":"Knop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1703-1236","authenticated-orcid":false,"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.ipl.2008.10.003","volume":"109","author":"EM Arkin","year":"2009","unstructured":"Arkin, E.M., Bae, S.W., Efrat, A., Okamoto, K., Mitchell, J.S.B., Polishchuk, V.: Geometric stable roommates. Inf. Process. Lett. 109(4), 219\u2013224 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jeth.1998.2469","volume":"84","author":"M Balinski","year":"1999","unstructured":"Balinski, M., S\u00f6nmez, T.: A tale of two mechanisms: student placement. J. Econ. Theor. 84(1), 73\u201394 (1999)","journal-title":"J. Econ. Theor."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1963190.1970372","volume":"16","author":"P Bir\u00f3","year":"2011","unstructured":"Bir\u00f3, P., Irving, R.W., Schlotter, I.: Stable matching with couples: an empirical study. ACM J. Exp. Algorithmics 16, 1\u201327 (2011)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"1","key":"5_CR4","first-page":"22","volume":"10","author":"S Braun","year":"2010","unstructured":"Braun, S., Dwenger, N., K\u00fcbler, D.: Telling the truth may not pay off: an empirical study of centralized university admissions in Germany. B. E. J. Econ. Anal. Policy 10(1), 22 (2010)","journal-title":"B. E. J. Econ. Anal. Policy"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Heeger, K., Knop, D., Niedermeier, R.: Multidimensional stable roommates with master list. arXiv:2009.14191 (2020)","DOI":"10.1007\/978-3-030-64946-3_5"},{"key":"5_CR6","series-title":"Bibliotheca Mathematica","volume-title":"Asymptotic Methods in Analysis","author":"NG de Bruijn","year":"1958","unstructured":"de Bruijn, N.G.: Asymptotic Methods in Analysis. Bibliotheca Mathematica, vol. 4. Interscience Publishers Inc., New York (1958). North-Holland Publishing Co., Amsterdam; P. Noordhoff Ltd., Groningen"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Cseh, \u00c1., Fleiner, T., Harj\u00e1n, P.: Pareto optimal coalitions of fixed size. arXiv:1901.06737 (2019)","DOI":"10.22574\/jmid.2019.11.003"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.comnet.2012.09.021","volume":"57","author":"L Cui","year":"2013","unstructured":"Cui, L., Jia, W.: Cyclic stable matching for three-sided networking services. Comput. Netw. 57(1), 351\u2013363 (2013)","journal-title":"Comput. Netw."},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0165-4896(03)00073-8","volume":"46","author":"VI Danilov","year":"2003","unstructured":"Danilov, V.I.: Existence of stable matchings in some three-sided systems. Math. Soc. Sci. 46(2), 145\u2013148 (2003)","journal-title":"Math. Soc. Sci."},{"issue":"13\u201314","key":"5_CR10","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\u201314), 1837\u20131842 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"51","key":"5_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"2","author":"RP Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 2(51), 161\u2013166 (1950)","journal-title":"Ann. Math."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-319-93031-2_13","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"G Escamocher","year":"2018","unstructured":"Escamocher, G., O\u2019Sullivan, B.: Three-dimensional matching instances are rich in stable matchings. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 182\u2013197. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_13"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/978-3-540-74466-5_88","volume-title":"Euro-Par 2007 Parallel Processing","author":"A-T Gai","year":"2007","unstructured":"Gai, A.-T., Lebedev, D., Mathieu, F., de Montgolfier, F., Reynier, J., Viennot, L.: Acyclic preference systems in P2P networks. In: Kermarrec, A.-M., Boug\u00e9, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 825\u2013834. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74466-5_88"},{"issue":"1","key":"5_CR14","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.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-030-33792-6_43","volume-title":"PRIMA 2019: Principles and Practice of Multi-Agent Systems","author":"T Hanaka","year":"2019","unstructured":"Hanaka, T., Kiya, H., Maei, Y., Ono, H.: Computational complexity of hedonic games on sparse graphs. In: Baldoni, M., Dastani, M., Liao, B., Sakurai, Y., Zalila Wenkstern, R. (eds.) PRIMA 2019. LNCS (LNAI), vol. 11873, pp. 576\u2013584. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-33792-6_43"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.mathsocsci.2016.04.006","volume":"82","author":"J Hofbauer","year":"2016","unstructured":"Hofbauer, J.: $$d$$-dimensional stable matching with cyclic preferences. Math. Soc. Sci. 82, 72\u201376 (2016)","journal-title":"Math. Soc. Sci."},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"RW Irving","year":"1985","unstructured":"Irving, R.W.: An efficient algorithm for the \u201cStable Roommates\u201d problem. J. Algorithms 6(4), 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"issue":"15","key":"5_CR18","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1016\/j.dam.2008.01.002","volume":"156","author":"RW Irving","year":"2008","unstructured":"Irving, R.W., Manlove, D., Scott, S.: The stable marriage problem with master preference lists. Discret. Appl. Math. 156(15), 2959\u20132977 (2008)","journal-title":"Discret. Appl. Math."},{"key":"5_CR19","unstructured":"Iwama, K., Miyazaki, S., Okamoto, K.: Stable roommates problem with triple rooms. In: Proceedings of WAAC 2007, pp. 105\u2013112 (2007)"},{"key":"5_CR20","unstructured":"Kamiyama, N.: Many-to-many stable matchings with ties, master preference lists, and matroid constraints. Proceedings of AAMAS 2019, pp. 583\u2013591 (2019)"},{"issue":"3","key":"5_CR21","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/s10878-012-9537-0","volume":"27","author":"T Kavitha","year":"2012","unstructured":"Kavitha, T., Nasre, M., Nimbhorkar, P.: Popularity at minimum cost. J. Comb. Optim. 27(3), 574\u2013596 (2012). https:\/\/doi.org\/10.1007\/s10878-012-9537-0","journal-title":"J. Comb. Optim."},{"key":"5_CR22","unstructured":"Knuth, D.E.: Mariages stables et leurs relations avec d\u2019autres probl\u00e8mes combinatoires. Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al, Montreal, Que (1976)"},{"key":"5_CR23","unstructured":"Kunysz, A.: The strongly stable roommates problem. In: Proceedings of ESA, pp. 60:1\u201360:15 (2016)"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-030-30473-7_22","volume-title":"Algorithmic Game Theory","author":"C-K Lam","year":"2019","unstructured":"Lam, C.-K., Plaxton, C.G.: On the existence of three-dimensional stable matchings with cyclic preferences. In: Fotakis, D., Markakis, E. (eds.) SAGT 2019. LNCS, vol. 11801, pp. 329\u2013342. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30473-7_22"},{"issue":"2","key":"5_CR25","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/0404023","volume":"4","author":"C Ng","year":"1991","unstructured":"Ng, C., Hirschberg, D.S.: Three-dimensional stable matching problems. SIAM J. Discret. Math. 4(2), 245\u2013252 (1991)","journal-title":"SIAM J. Discret. Math."},{"key":"5_CR26","unstructured":"O\u2019Malley, G.: Algorithmic Aspects of Stable Matching Problems. Ph.D. thesis, University of Glasgow, Department of Computing Sciences (2007)"},{"key":"5_CR27","unstructured":"Ostrovsky, R., Rosenbaum, W.: It\u2019s not easy being three: The approximability of three-dimensional stable matching problems. arXiv:1412.1130 (2014)"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00182-007-0083-4","volume":"36","author":"N Perach","year":"2008","unstructured":"Perach, N., Polak, J., Rothblum, U.G.: A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion. Int. J. Game Theor. 36, 519\u2013535 (2008). https:\/\/doi.org\/10.1007\/s00182-007-0083-4","journal-title":"Int. J. Game Theor."},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Peters, D.: Graphical hedonic games of bounded treewidth. Proceedings of AAAI 2016, pp. 586\u2013593 (2016)","DOI":"10.1609\/aaai.v30i1.10046"},{"issue":"2","key":"5_CR30","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E Ronn","year":"1990","unstructured":"Ronn, E.: NP-complete stable matching problems. J. Algorithms 11(2), 285\u2013304 (1990)","journal-title":"J. Algorithms"},{"issue":"2","key":"5_CR31","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1162\/0033553041382157","volume":"119","author":"AE Roth","year":"2004","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Kidney exchange. Q. J. Econ. 119(2), 457\u2013488 (2004)","journal-title":"Q. J. Econ."},{"key":"5_CR32","series-title":"Springer Texts in Business and Economics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47904-9","volume-title":"Economics and Computation","year":"2016","unstructured":"Rothe, J. (ed.): Economics and Computation. STBE. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-47904-9"},{"key":"5_CR33","unstructured":"Scott, S.: A Study of Stable Marriage Problems with Ties. Ph.D. thesis, University of Glasgow, Department of Computing Sciences (2005)"},{"key":"5_CR34","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":"5_CR35","doi-asserted-by":"crossref","unstructured":"Wu, J.: Stable matching beyond bipartite graphs. In: IPDPS Workshops 2016, pp. 480\u2013488. IEEE Computer Society (2016)","DOI":"10.1109\/IPDPSW.2016.207"},{"issue":"1","key":"5_CR36","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/s10878-017-0224-z","volume":"37","author":"L Zhong","year":"2017","unstructured":"Zhong, L., Bai, Y.: Three-sided stable matching problem with two of them as cooperative partners. J. Comb. Optim 37(1), 286\u2013292 (2017). https:\/\/doi.org\/10.1007\/s10878-017-0224-z","journal-title":"J. Comb. Optim"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T16:48:18Z","timestamp":1669999698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","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":"136","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":"31","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":"11","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":"23% - 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":"10","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)"}}]}}