{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:43:45Z","timestamp":1743147825683,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496103"},{"type":"electronic","value":"9783031496110"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49611-0_23","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"316-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Popularity on\u00a0the\u00a0Roommate Diversity Problem"],"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":[[2023,12,9]]},"reference":[{"key":"23_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"},{"issue":"4","key":"23_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0167-6377(86)90072-6","volume":"5","author":"J Bartholdi","year":"1986","unstructured":"Bartholdi, J., Trick, M.A.: Stable matching with preferences derived from a psychological model. Oper. Res. Lett. 5(4), 165\u2013169 (1986)","journal-title":"Oper. Res. Lett."},{"key":"23_CR3","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"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Boehmer, N., Elkind, E.: Individual-based stability in hedonic diversity games. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02, pp. 1822\u20131829 (2020)","DOI":"10.1609\/aaai.v34i02.5549"},{"key":"23_CR5","doi-asserted-by":"publisher","unstructured":"Boehmer, N., Elkind, E.: Stable roommate problem with diversity preferences. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI\u201920 (2021). https:\/\/doi.org\/10.24963\/ijcai.2020\/14","DOI":"10.24963\/ijcai.2020\/14"},{"key":"23_CR6","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","DOI":"10.1613\/jair.1.13470"},{"key":"23_CR7","unstructured":"Bredereck, R., Elkind, E., Igarashi, A.: Hedonic diversity games. In: International Foundation for Autonomous Agents and Multiagent Systems, pp. 565\u2013573 (2019). https:\/\/ora.ox.ac.uk\/objects\/uuid:f99dde29-43d0-4cd8-95a9-6268ae764637"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10458-020-09470-x","volume":"34","author":"R Bredereck","year":"2020","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)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1006\/game.1999.0779","volume":"33","author":"KS Chung","year":"2000","unstructured":"Chung, K.S.: On the existence of stable roommate matchings. Games Econ. Behav. 33(2), 206\u2013230 (2000)","journal-title":"Games Econ. Behav."},{"key":"23_CR10","unstructured":"Cseh, \u00c1.: Popular matchings, chap. 6, p. 105\u2013122. Lulu. com (2017). https:\/\/archive.illc.uva.nl\/COST-IC1205\/Book\/"},{"key":"23_CR11","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. https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3434427","DOI":"10.1145\/3434427"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Cseh, \u00c1., Kavitha, T.: Popular matchings in complete graphs. Algorithmica 83(5), 1493\u20131523 (2021)","DOI":"10.1007\/s00453-020-00791-7"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-030-87756-9_23","volume-title":"Algorithmic Decision Theory","author":"A Darmann","year":"2021","unstructured":"Darmann, A.: Hedonic diversity games revisited. In: Fotakis, D., R\u00edos Insua, D. (eds.) ADT 2021. LNCS (LNAI), vol. 13023, pp. 357\u2013372. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-87756-9_23"},{"key":"23_CR14","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","DOI":"10.1137\/1.9781611975482.173"},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Ganian, R., Hamm, T., Knop, D., Schierreich, \u0160, Such\u1ef3, O.: Hedonic diversity games: a complexity picture with more than two colors. In:Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 5, pp. 5034\u20135042 (2022). https:\/\/doi.org\/10.1609\/aaai.v36i5.20435. https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/20435","DOI":"10.1609\/aaai.v36i5.20435"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P G\u00e4rdenfors","year":"1975","unstructured":"G\u00e4rdenfors, P.: Match making: assignments based on bilateral preferences. Syst. Res. Behav. Sci. 20, 166\u2013173 (1975)","journal-title":"Syst. Res. Behav. Sci."},{"key":"23_CR17","doi-asserted-by":"publisher","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA (1990). https:\/\/doi.org\/10.1137\/1024022. https:\/\/epubs.siam.org\/doi\/10.1137\/1024022","DOI":"10.1137\/1024022"},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Ge, S., Itoh, T.: Popularity on the Roommate Diversity Problem. CoRR abs\/2210.07911 (2022). https:\/\/doi.org\/10.48550\/arXiv.2210.07911. https:\/\/arxiv.org\/abs\/2210.07911","DOI":"10.48550\/arXiv.2210.07911"},{"key":"23_CR19","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. https:\/\/dl.acm.org\/doi\/10.1145\/3442354","DOI":"10.1145\/3442354"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Manlove, D.: Algorithmics of Matching Under Preferences. In: Bulletin of EATCS (2013)","DOI":"10.1142\/8591"},{"key":"23_CR21","doi-asserted-by":"publisher","unstructured":"v. Neumann, J.: Zur Theorie der Gesellschaftsspiele. Mathematische Annalen 100(1), 295\u2013320 (1928). https:\/\/doi.org\/10.1007\/BF01448847. https:\/\/link.springer.com\/article\/10.1007\/BF01448847","DOI":"10.1007\/BF01448847"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49611-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:08:41Z","timestamp":1707556121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49611-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496103","9783031496110"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49611-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","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":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","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":"73","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":"62% - 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":"6","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)"}}]}}