{"id":"https://openalex.org/W4417088236","doi":"https://doi.org/10.48550/arxiv.2505.06163","title":"The Power of Matching for Online Fractional Hedonic Games","display_name":"The Power of Matching for Online Fractional Hedonic Games","publication_year":2025,"publication_date":"2025-05-09","ids":{"openalex":"https://openalex.org/W4417088236","doi":"https://doi.org/10.48550/arxiv.2505.06163"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2505.06163","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2505.06163","pdf_url":"https://arxiv.org/pdf/2505.06163","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2505.06163","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047161904","display_name":"Martin Bullinger","orcid":"https://orcid.org/0000-0003-4013-1323"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bullinger, Martin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028529412","display_name":"Ren\u00e9 Romen","orcid":"https://orcid.org/0000-0002-6447-7794"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Romen, Ren\u00e9","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5120694922","display_name":"Alexander Schlenga","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schlenga, Alexander","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047161904"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9840999841690063,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.006800000090152025,"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.0035000001080334187,"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/competitive-analysis","display_name":"Competitive analysis","score":0.9039000272750854},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7896999716758728},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7501999735832214},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6017000079154968},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5799999833106995},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5496000051498413},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.522599995136261},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.39559999108314514},{"id":"https://openalex.org/keywords/identification","display_name":"Identification (biology)","score":0.3808000087738037}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9039000272750854},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7896999716758728},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7501999735832214},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6017000079154968},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5799999833106995},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5496000051498413},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.522599995136261},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5073999762535095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5062999725341797},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.39559999108314514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38920000195503235},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.3808000087738037},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3637999892234802},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3499000072479248},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.3357999920845032},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3352000117301941},{"id":"https://openalex.org/C134121241","wikidata":"https://www.wikidata.org/wiki/Q899301","display_name":"Yield (engineering)","level":2,"score":0.32359999418258667},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.3149999976158142},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C82149807","wikidata":"https://www.wikidata.org/wiki/Q7242623","display_name":"Price of anarchy","level":4,"score":0.2775000035762787},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.25780001282691956},{"id":"https://openalex.org/C2780964549","wikidata":"https://www.wikidata.org/wiki/Q5156353","display_name":"Competitive equilibrium","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2505.06163","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2505.06163","pdf_url":"https://arxiv.org/pdf/2505.06163","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/7702495c-181b-4ee9-bac1-5490687ee321","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/7702495c-181b-4ee9-bac1-5490687ee321","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bullinger, M, Romen, R & Schlenga, A 2025, The Power of Matching for Online Fractional Hedonic Games. in Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2025, Society for Industrial and Applied Mathematics.","raw_type":"contributionToPeriodical"},{"id":"doi:10.48550/arxiv.2505.06163","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2505.06163","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2505.06163","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2505.06163","pdf_url":"https://arxiv.org/pdf/2505.06163","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"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":{"We":[0,89],"study":[1],"coalition":[2,43],"formation":[3,44],"in":[4,19,41,97,139,173],"the":[5,69,103,124],"framework":[6],"of":[7,102,105,126,134,143,153,166,198],"fractional":[8],"hedonic":[9],"games":[10],"(FHGs).":[11],"The":[12],"objective":[13],"is":[14,45,80,123],"to":[15,33,54,181],"maximize":[16],"social":[17],"welfare":[18],"an":[20,115,135,150,161,174,194],"online":[21,42,47,75,144],"model":[22,142],"where":[23,50,121],"agents":[24,171],"arrive":[25,172],"one":[26,28],"by":[27],"and":[29,36,149,183],"must":[30],"be":[31],"assigned":[32],"coalitions":[34,51],"immediately":[35],"irrevocably.":[37],"A":[38],"recurrent":[39],"theme":[40],"that":[46,189],"matching":[48,137,145],"algorithms,":[49],"are":[52,86,179],"restricted":[53],"size":[55],"at":[56],"most":[57],"$2$,":[58],"yield":[59],"good":[60],"competitive":[61,71,95,164,196],"ratios.":[62],"For":[63],"example,":[64],"computing":[65],"maximal":[66],"matchings":[67],"achieves":[68,193],"optimal":[70,91,117,136,163,195],"ratio":[72,79,165,197],"for":[73],"general":[74,141],"FHGs.":[76],"However,":[77],"this":[78,156],"bounded":[81],"only":[82],"if":[83],"agents'":[84],"valuations":[85],"themselves":[87],"bounded.":[88],"identify":[90],"algorithms":[92,178],"with":[93,146],"constant":[94],"ratios":[96],"two":[98],"related":[99],"settings,":[100],"independent":[101],"range":[104],"agent":[106,111],"valuations.":[107],"First,":[108],"under":[109],"random":[110],"arrival,":[112],"we":[113,158,187],"present":[114],"asymptotically":[116,162],"$(\\frac{1}{3}-\\frac":[118],"1n)$-competitive":[119],"algorithm,":[120],"$n$":[122],"number":[125,152],"agents.":[127,154],"This":[128],"result":[129],"builds":[130],"on":[131],"our":[132],"identification":[133],"algorithm":[138,192],"a":[140],"edge":[147],"weights":[148],"unknown":[151],"In":[155],"setting,":[157],"also":[159],"achieve":[160],"$\\frac{1}{3}-\\frac":[167],"1n$.":[168],"Second,":[169],"when":[170],"arbitrary":[175],"order":[176],"but":[177],"allowed":[180],"irrevocably":[182],"entirely":[184],"dissolve":[185],"coalitions,":[186],"show":[188],"another":[190],"matching-based":[191],"$\\frac{1}{6":[199],"+":[200],"4\\sqrt{2}}$.":[201]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}