{"id":"https://openalex.org/W4415428709","doi":"https://doi.org/10.3233/faia250959","title":"Algorithms for Stable Roommate with Externalities","display_name":"Algorithms for Stable Roommate with Externalities","publication_year":2025,"publication_date":"2025-10-21","ids":{"openalex":"https://openalex.org/W4415428709","doi":"https://doi.org/10.3233/faia250959"},"language":null,"primary_location":{"id":"doi:10.3233/faia250959","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia250959","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.3233/faia250959","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022810195","display_name":"Jing Leng","orcid":"https://orcid.org/0000-0002-8454-4835"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jing Leng","raw_affiliation_strings":["University of Leeds, UK"],"affiliations":[{"raw_affiliation_string":"University of Leeds, UK","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072480352","display_name":"Sanjukta Roy","orcid":"https://orcid.org/0000-0003-3633-542X"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sanjukta Roy","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022810195"],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.66479137,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9696999788284302,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9696999788284302,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6157000064849854},{"id":"https://openalex.org/keywords/conjunction","display_name":"Conjunction (astronomy)","score":0.553600013256073},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5120999813079834},{"id":"https://openalex.org/keywords/preference","display_name":"Preference","score":0.5097000002861023},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.491100013256073},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.3995000123977661},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.3862999975681305},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.38019999861717224}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6157000064849854},{"id":"https://openalex.org/C59656382","wikidata":"https://www.wikidata.org/wiki/Q191536","display_name":"Conjunction (astronomy)","level":2,"score":0.553600013256073},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5120999813079834},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.5097000002861023},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.491100013256073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4765999913215637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4341000020503998},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41370001435279846},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.3995000123977661},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.3862999975681305},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.384799987077713},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.38019999861717224},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3790999948978424},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.34380000829696655},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3082999885082245},{"id":"https://openalex.org/C48327123","wikidata":"https://www.wikidata.org/wiki/Q317","display_name":"Dictatorship","level":4,"score":0.3018999993801117},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2939999997615814},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.28850001096725464},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.2867000102996826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28369998931884766},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2590999901294708}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia250959","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia250959","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.3233/faia250959","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia250959","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"the":[1,27,34,37,98,136],"roommate":[2,28,62],"matching":[3,29],"model,":[4],"given":[5],"a":[6,19,24,80,88,148],"set":[7],"of":[8,18,21,36,60,120,138],"2n":[9],"agents":[10,22,40],"and":[11,46,68,76,95],"n":[12],"rooms,":[13],"we":[14,108,143],"find":[15],"an":[16],"assignment":[17,90,140,150],"pair":[20],"to":[23],"room.":[25],"Although":[26],"problem":[30],"is":[31,92,102,141],"well":[32],"studied,":[33],"study":[35,57,109],"model":[38],"when":[39],"have":[41],"preference":[42,145],"over":[43],"both":[44],"rooms":[45],"roommates":[47],"was":[48],"recently":[49],"initiated":[50],"by":[51],"Chan":[52,129],"et":[53,130],"al.":[54,131],"[11].":[55],"We":[56,78,116],"two":[58],"types":[59],"stable":[61,66,70],"assignments,":[63],"namely,":[64],"4-person":[65],"(4PS)":[67],"2-person":[69],"(2PS)":[71],"in":[72,154],"conjunction":[73],"with":[74],"efficiency":[75],"strategy-proofness.":[77],"design":[79],"simple":[81],"serial":[82,99],"dictatorship":[83,100],"based":[84,114],"algorithm":[85,101],"for":[86],"finding":[87],"4PS":[89],"that":[91,118,134],"Pareto":[93],"optimal":[94],"strategy-proof.":[96],"However,":[97],"far":[103],"from":[104],"being":[105],"2PS.":[106],"Next,":[107],"top":[110],"trading":[111],"cycle":[112],"(TTC)":[113],"algorithms.":[115],"show":[117],"variations":[119],"TTC":[121],"cannot":[122],"be":[123,152],"strategy-proof":[124],"or":[125],"PO.":[126],"Finally,":[127],"as":[128],"(2016)":[132],"showed":[133],"deciding":[135],"existence":[137],"2PS":[139,149],"NP-complete,":[142],"identify":[144],"structures":[146],"where":[147],"can":[151],"found":[153],"polynomial":[155],"time.":[156]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-24T00:00:00"}