{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T21:06:20Z","timestamp":1761599180707,"version":"3.37.3"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472079","61806053","61807008"],"award-info":[{"award-number":["61472079","61806053","61807008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20171363","BK20180356","BK20180369"],"award-info":[{"award-number":["BK20171363","BK20180356","BK20180369"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2907708","type":"journal-article","created":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T21:46:28Z","timestamp":1553723188000},"page":"42968-42986","source":"Crossref","is-referenced-by-count":7,"title":["Room Allocation With Capacity Diversity and Budget Constraints"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6161-6242","authenticated-orcid":false,"given":"Yunpeng","family":"Li","sequence":"first","affiliation":[{"name":"Innovation Group for Interdisciplinary Computing Technologies, College of Computer Science and Technology, Xi&#x2019;an University of Science and Technology, Xi&#x2019;an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7349-5249","authenticated-orcid":false,"given":"Yichuan","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Southeast University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6348-125X","authenticated-orcid":false,"given":"Weiwei","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Southeast University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8249-1725","authenticated-orcid":false,"given":"Jiuchuan","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanyang Technological University, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Fan","sequence":"additional","affiliation":[{"name":"Co-Innovation Center of Shandong Colleges, Universities-Future Intelligent Computing, Shandong Technology and Business University, Yantai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"183","article-title":"Stable partitions in additively separable hedonic games","author":"aziz","year":"2011","journal-title":"Proc 10th Int Conf Auton Agents Multiagent Syst"},{"key":"ref38","first-page":"565","article-title":"Group activity selection on social networks","author":"igarashi","year":"2017","journal-title":"Proc AAAI Conf Artif Intell (AAAI)"},{"key":"ref33","first-page":"5","article-title":"Fractional hedonic games","author":"aziz","year":"2014","journal-title":"Proc Int Conf Auton Agents and Multi Agent Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.09.006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2307\/1912943"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s001820000053"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/978-3-642-35311-6_12","article-title":"Group activity selection problem","author":"darmann","year":"2012","journal-title":"Proc of International Workshop on Internet and Network Economics"},{"key":"ref36","first-page":"287","article-title":"Stable marriage and roommate problems with individual-based stability","author":"aziz","year":"2013","journal-title":"The 2013 Intl Conf on Aut Agents and Multi-Agent Systems"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1613\/jair.1.11211","article-title":"Nash stable outcomes in fractional hedonic games: Existence, efficiency and computation","volume":"62","author":"bil\u00f2","year":"2018","journal-title":"J Artif Intell Res"},{"key":"ref34","first-page":"461","article-title":"Welfare maximization in fractional hedonic games","author":"aziz","year":"2015","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s003550000067"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2013.08.006"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1006\/game.2001.0877"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/34"},{"key":"ref1","first-page":"446","article-title":"Assignment and pricing in roommate market","author":"chan","year":"2016","journal-title":"Proc AAAI Conf Artif Intell (AAAI)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.175"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134733"},{"key":"ref21","first-page":"424","article-title":"Popular matchings","author":"abraham","year":"2005","journal-title":"Proc 16th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref24","first-page":"492","article-title":"Popular matchings in the capacitated house allocation problem","author":"manlove","year":"2006","journal-title":"Proc Eur Symp Algorithms"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/11786986_62"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38233-8_27"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2008.11.008"},{"key":"ref50","first-page":"48","article-title":"An improved approximation algorithm for MULTIWAY CUT","author":"c?linescu","year":"1998","journal-title":"Proc 13th Annu ACM Symp Theory Comput"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792225297"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20053"},{"key":"ref56","article-title":"Computers and intractability: A guide to the theory of np-completeness","volume":"340","author":"garey","year":"1979","journal-title":"Computers and Intractability"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1350-7"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591866"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1030.0086"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00065-X"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90007-2"},{"key":"ref11","first-page":"275","article-title":"Exchange-proofness or divorce-proofness? Stability in one-sided matching markets","volume":"1","author":"alcalde","year":"1994","journal-title":"Economics"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00230-X"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.06.003"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-642-13073-1_10","article-title":"Popular matchings in the marriage and roommates problems","author":"bir\u00f3","year":"2010","journal-title":"Proc 7th Int Conf Algorithms Complex"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2830639"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2760801"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2810216"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(86)90072-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0917"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90033-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00125-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67504-6_22"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2002.1219"},{"journal-title":"The Stable Marriage Problem Structure and Algorithms","year":"1989","author":"gusfield","key":"ref7"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.158"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jet.2016.12.012"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461930"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2001.969727"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488675"},{"key":"ref47","first-page":"39","article-title":"An improved integrality gap for the C?linescu-Karloff-Rabani relaxation for multiway cut","author":"angelidakis","year":"2017","journal-title":"Proc Int Conf Integer Program Combinat Optim"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44985-X_19"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580665"},{"key":"ref44","first-page":"1","article-title":"Np-complete problem: Partition into triangles","author":"complessit\u00e1","year":"2004"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1155"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08675293.pdf?arnumber=8675293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T19:40:13Z","timestamp":1735674013000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8675293\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2907708","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}