{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:24Z","timestamp":1742914164362,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819628445"},{"type":"electronic","value":"9789819628452"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_13","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:06Z","timestamp":1740067206000},"page":"196-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Popularity on\u00a0the\u00a03D-Euclidean Stable Roommates"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5073-748X","authenticated-orcid":false,"given":"Steven","family":"Ge","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1149-7046","authenticated-orcid":false,"given":"Toshiya","family":"Itoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-77105-0_48","volume-title":"Internet and Network Economics","author":"DJ Abraham","year":"2007","unstructured":"Abraham, D.J., Levavi, A., Manlove, D.F., O\u2019Malley, G.: The stable roommates problem with globally-ranked pairs. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 431\u2013444. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77105-0_48"},{"doi-asserted-by":"publisher","unstructured":"Arkin, E.M., Bae, S.W., Efrat, A., Okamoto, K., Mitchell, J.S., Polishchuk, V.: Geometric stable roommates. Inf. Process. Lett. 109(4), 219\u2013224 (2009). https:\/\/doi.org\/10.1016\/j.ipl.2008.10.003, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020019008003098","key":"13_CR2","DOI":"10.1016\/j.ipl.2008.10.003"},{"doi-asserted-by":"publisher","unstructured":"Bartholdi, J., Trick, M.A.: Stable matching with preferences derived from a psychological model. Oper. Res. Lett. 5(4), 165\u2013169 (1986). https:\/\/doi.org\/10.1016\/0167-6377(86)90072-6, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0167637786900726","key":"13_CR3","DOI":"10.1016\/0167-6377(86)90072-6"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-13073-1_10","volume-title":"Algorithms and Complexity","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Irving, R.W., Manlove, D.F.: Popular matchings in the marriage and roommates problems. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 97\u2013108. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13073-1_10"},{"doi-asserted-by":"publisher","unstructured":"Brandt, F., Bullinger, M.: Finding and recognizing popular coalition structures. J. Artif. Int. Res. 74 (2022). https:\/\/doi.org\/10.1613\/jair.1.13470, https:\/\/jair.org\/index.php\/jair\/article\/view\/13470","key":"13_CR5","DOI":"10.1613\/jair.1.13470"},{"doi-asserted-by":"publisher","unstructured":"Bredereck, R., Chen, J., Finnendahl, U.P., Niedermeier, R.: Stable roommates with narcissistic, single-peaked, and single-crossing preferences. Auton. Agent. Multi-Agent Syst. 34(2), 53 (2020). https:\/\/doi.org\/10.1007\/s10458-020-09470-x, https:\/\/link.springer.com\/article\/10.1007\/s10458-020-09470-x","key":"13_CR6","DOI":"10.1007\/s10458-020-09470-x"},{"doi-asserted-by":"publisher","unstructured":"Chen, J., Roy, S.: Multi-dimensional stable roommates in 2-dimensional euclidean space. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0244, pp. 36:1\u201336:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.36, https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/LIPIcs.ESA.2022.36","key":"13_CR7","DOI":"10.4230\/LIPIcs.ESA.2022.36"},{"doi-asserted-by":"publisher","unstructured":"Chung, K.S.: On the existence of stable roommate matchings. Games Econom. Behav. 33(2), 206\u2013230 (2000). https:\/\/doi.org\/10.1006\/game.1999.0779, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0899825699907790","key":"13_CR8","DOI":"10.1006\/game.1999.0779"},{"unstructured":"Cseh, \u00c1.: Popular matchings, chap.\u00a06, p. 105-122. Lulu. com (2017). https:\/\/archive.illc.uva.nl\/COST-IC1205\/Book\/","key":"13_CR9"},{"doi-asserted-by":"publisher","unstructured":"Cseh, A., Juhos, A.: Pairwise preferences in the stable marriage problem. ACM Trans. Econ. Comput. 9(1) (2021). https:\/\/doi.org\/10.1145\/3434427","key":"13_CR10","DOI":"10.1145\/3434427"},{"doi-asserted-by":"publisher","unstructured":"Cseh, \u00c1., Kavitha, T.: Popular matchings in complete graphs. Algorithmica 83(5), 1493\u20131523 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00791-7, https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00791-7","key":"13_CR11","DOI":"10.1007\/s00453-020-00791-7"},{"issue":"6","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G Di Battista","year":"1998","unstructured":"Di Battista, G., Liotta, G., Vargiu, F.: Spirality and optimal orthogonal drawings. SIAM J. Comput. 27(6), 1764\u20131811 (1998). https:\/\/doi.org\/10.1137\/S0097539794262847","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Faenza, Y., Kavitha, T., Powers, V., Zhang, X.: Popular matchings and limits to tractability, pp. 2790\u20132809. https:\/\/doi.org\/10.1137\/1.9781611975482.173, https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611975482.173","key":"13_CR13","DOI":"10.1137\/1.9781611975482.173"},{"doi-asserted-by":"publisher","unstructured":"G\u00e4rdenfors, P.: Match making: assignments based on bilateral preferences. Syst. Res. Behav. Sci. 20, 166\u2013173 (1975). https:\/\/doi.org\/10.1002\/bs.3830200304, https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/bs.3830200304","key":"13_CR14","DOI":"10.1002\/bs.3830200304"},{"doi-asserted-by":"publisher","unstructured":"Gupta, S., Misra, P., Saurabh, S., Zehavi, M.: Popular matching in roommates setting is NP-hard. ACM Trans. Comput. Theory 13(2) (2021). https:\/\/doi.org\/10.1145\/3442354","key":"13_CR15","DOI":"10.1145\/3442354"},{"doi-asserted-by":"crossref","unstructured":"Manlove, D.: Algorithmics of Matching Under Preferences. In: Bull. EATCS (2013)","key":"13_CR16","DOI":"10.1142\/8591"},{"doi-asserted-by":"publisher","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Trans. Comput. C-30(2), 135\u2013140 (1981). https:\/\/doi.org\/10.1109\/TC.1981.6312176","key":"13_CR17","DOI":"10.1109\/TC.1981.6312176"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:09Z","timestamp":1740067209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}