{"id":"https://openalex.org/W4413019887","doi":"https://doi.org/10.1145/3758324","title":"Online Coalition Formation under Random Arrival or Coalition Dissolution","display_name":"Online Coalition Formation under Random Arrival or Coalition Dissolution","publication_year":2025,"publication_date":"2025-08-06","ids":{"openalex":"https://openalex.org/W4413019887","doi":"https://doi.org/10.1145/3758324"},"language":"en","primary_location":{"id":"doi:10.1145/3758324","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3758324","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047161904","display_name":"Martin Bullinger","orcid":"https://orcid.org/0000-0003-4013-1323"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Martin Bullinger","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Oxford, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-4013-1323","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Oxford, United Kingdom","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028529412","display_name":"Ren\u00e9 Romen","orcid":"https://orcid.org/0000-0002-6447-7794"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ren\u00e9 Romen","raw_affiliation_strings":["School of Computation, Information and Technology, Technical University of Munich, Munich, Germany"],"raw_orcid":"https://orcid.org/0000-0002-6447-7794","affiliations":[{"raw_affiliation_string":"School of Computation, Information and Technology, Technical University of Munich, Munich, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047161904"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":1.3104,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83902351,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"22","issue":"1","first_page":"1","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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.9997000098228455,"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"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5150101184844971},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3403922915458679}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5150101184844971},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3403922915458679}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3758324","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3758324","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W1514707655","https://openalex.org/W1965972569","https://openalex.org/W1985875030","https://openalex.org/W1995484833","https://openalex.org/W2017681469","https://openalex.org/W2029781483","https://openalex.org/W2038992031","https://openalex.org/W2041293803","https://openalex.org/W2068115726","https://openalex.org/W2068574579","https://openalex.org/W2070069359","https://openalex.org/W2085480884","https://openalex.org/W2102617746","https://openalex.org/W2134660637","https://openalex.org/W2141263345","https://openalex.org/W2143122080","https://openalex.org/W2145593504","https://openalex.org/W2165753192","https://openalex.org/W2241862190","https://openalex.org/W2260025217","https://openalex.org/W2295981146","https://openalex.org/W2340985688","https://openalex.org/W2560674852","https://openalex.org/W2608239929","https://openalex.org/W2914959486","https://openalex.org/W2952554568","https://openalex.org/W2963014036","https://openalex.org/W2963693668","https://openalex.org/W2972193181","https://openalex.org/W2997040462","https://openalex.org/W3021716563","https://openalex.org/W3037692074","https://openalex.org/W3045038631","https://openalex.org/W3098705741","https://openalex.org/W3101104511","https://openalex.org/W3121437753","https://openalex.org/W3125555204","https://openalex.org/W3149523783","https://openalex.org/W3208235834","https://openalex.org/W4200029672","https://openalex.org/W4233756358","https://openalex.org/W4236254022","https://openalex.org/W4285396506","https://openalex.org/W4292027170","https://openalex.org/W4309396322","https://openalex.org/W4360612324","https://openalex.org/W4376256773","https://openalex.org/W4387475908","https://openalex.org/W4389615663","https://openalex.org/W4399246445","https://openalex.org/W4400116611","https://openalex.org/W4406930291","https://openalex.org/W4409790455","https://openalex.org/W6683950758","https://openalex.org/W6846179486"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Coalition":[0],"formation":[1],"explores":[2],"how":[3],"to":[4,17,46,63,66,78,179],"partition":[5],"a":[6,22,104,110,143,176,180,192],"set":[7],"of":[8,31,90,119,146,154,160,172,183],"\\(":[9],"n":[10],"\\)":[11],"agents":[12,39,55,107],"into":[13,162],"disjoint":[14],"coalitions":[15,67,161],"according":[16],"their":[18],"preferences.":[19],"We":[20,92,113,165],"consider":[21],"cardinal":[23],"utility":[24,199],"model":[25,105,182,204],"with":[26],"an":[27,58,80,128,167],"additively":[28],"separable":[29],"aggregation":[30],"preferences":[32],"and":[33,61,69,138,205],"study":[34,103],"the":[35,52,72,88,116,120,152,158,197,202,208],"online":[36,184],"variant,":[37],"where":[38,106],"arrive":[40,56,108],"in":[41,57,109,187,201],"sequence.":[42],"The":[43],"goal":[44],"is":[45,76,123,132],"achieve":[47,79,142,166],"competitive":[48,82,117,144,170,193],"social":[49],"welfare.":[50],"In":[51,126],"basic":[53,203],"model,":[54],"arbitrary":[59],"order":[60],"have":[62],"be":[64],"assigned":[65],"immediately":[68],"irrevocably.":[70],"There,":[71],"natural":[73],"greedy":[74,121,139],"algorithm":[75,122],"known":[77],"optimal":[81,169],"ratio,":[83],"which":[84,131],"heavily":[85],"relies":[86],"on":[87,134],"range":[89],"utilities.":[91],"complement":[93],"this":[94],"result":[95],"by":[96,156,174,213],"considering":[97],"two":[98],"related":[99],"models.":[100],"First,":[101],"we":[102,150,190],"random":[111],"order.":[112],"find":[114],"that":[115,195],"ratio":[118,145,171,194,212],"\\(\\Theta\\left(\\frac{1}{n^{2}}\\right)\\)":[124],".":[125,148],"contrast,":[127],"alternative":[129],"algorithm,":[130],"based":[133],"alternating":[135],"between":[136],"waiting":[137],"phases,":[140],"can":[141],"\\(\\Theta\\left(\\frac{1}{n}\\right)\\)":[147,173],"Second,":[149],"relax":[151],"irrevocability":[153],"decisions":[155],"allowing":[157],"dissolution":[159],"singleton":[163],"coalitions.":[164],"asymptotically":[168],"drawing":[175],"close":[177],"connection":[178],"general":[181],"matching.":[185],"Hence,":[186],"both":[188],"models,":[189],"obtain":[191],"removes":[196],"unavoidable":[198],"dependencies":[200],"essentially":[206],"matches":[207],"best":[209],"possible":[210],"approximation":[211],"polynomial-time":[214],"algorithms.":[215]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}