{"id":"https://openalex.org/W7118752329","doi":"https://doi.org/10.1137/1.9781611978971.79","title":"The Power of Matching for Online Fractional Hedonic Games","display_name":"The Power of Matching for Online Fractional Hedonic Games","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118752329","doi":"https://doi.org/10.1137/1.9781611978971.79"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.79","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.79","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research-information.bris.ac.uk/en/publications/7702495c-181b-4ee9-bac1-5490687ee321","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":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Martin Bullinger","raw_affiliation_strings":["University of Bristol"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bristol","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"middle","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":["Technical University of Munich"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120694922","display_name":"Alexander Schlenga","orcid":null},"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":"Alexander Schlenga","raw_affiliation_strings":["Technical University of Munich"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047161904"],"corresponding_institution_ids":["https://openalex.org/I36234482"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04374657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2163","last_page":"2194"},"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.989799976348877,"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.989799976348877,"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/T11182","display_name":"Auction Theory and Applications","score":0.0024999999441206455,"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/T12288","display_name":"Optimization and Search Problems","score":0.0017999999690800905,"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.7584999799728394},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6534000039100647},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6292999982833862},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5717999935150146},{"id":"https://openalex.org/keywords/yield","display_name":"Yield (engineering)","score":0.541100025177002},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.5034999847412109},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4268999993801117},{"id":"https://openalex.org/keywords/welfare","display_name":"Welfare","score":0.37380000948905945}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7584999799728394},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6534000039100647},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6292999982833862},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5717999935150146},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.5638999938964844},{"id":"https://openalex.org/C134121241","wikidata":"https://www.wikidata.org/wiki/Q899301","display_name":"Yield (engineering)","level":2,"score":0.541100025177002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5134000182151794},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.5034999847412109},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4268999993801117},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4101000130176544},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.4002000093460083},{"id":"https://openalex.org/C100243477","wikidata":"https://www.wikidata.org/wiki/Q12002092","display_name":"Welfare","level":2,"score":0.37380000948905945},{"id":"https://openalex.org/C33566652","wikidata":"https://www.wikidata.org/wiki/Q1065927","display_name":"Theme (computing)","level":2,"score":0.3727000057697296},{"id":"https://openalex.org/C58694771","wikidata":"https://www.wikidata.org/wiki/Q814385","display_name":"Bounded rationality","level":2,"score":0.36160001158714294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34209999442100525},{"id":"https://openalex.org/C149782125","wikidata":"https://www.wikidata.org/wiki/Q160039","display_name":"Econometrics","level":1,"score":0.30880001187324524},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.3052999973297119},{"id":"https://openalex.org/C82149807","wikidata":"https://www.wikidata.org/wiki/Q7242623","display_name":"Price of anarchy","level":4,"score":0.3009999990463257},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C536738050","wikidata":"https://www.wikidata.org/wiki/Q3249071","display_name":"Social Welfare","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C91306197","wikidata":"https://www.wikidata.org/wiki/Q45767","display_name":"Competition (biology)","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C2778348673","wikidata":"https://www.wikidata.org/wiki/Q739302","display_name":"Production (economics)","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/1.9781611978971.79","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.79","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/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 2026, The Power of Matching for Online Fractional Hedonic Games. in K G Larsen & B Saha (eds), 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, pp. 2163-2194. https://doi.org/10.1137/1.9781611978971.79","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/7702495c-181b-4ee9-bac1-5490687ee321","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/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 2026, The Power of Matching for Online Fractional Hedonic Games. in K G Larsen & B Saha (eds), 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, pp. 2163-2194. https://doi.org/10.1137/1.9781611978971.79","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:openaire/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 2026, The Power of Matching for Online Fractional Hedonic Games. in K G Larsen & B Saha (eds), 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, pp. 2163-2194. https://doi.org/10.1137/1.9781611978971.79","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5172969698905945,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"coalition":[2,43],"formation":[3,44],"in":[4,19,41],"the":[5,69],"framework":[6],"of":[7],"fractional":[8],"hedonic":[9],"games":[10],"(FHGs).":[11],"The":[12],"objective":[13],"is":[14,45,80],"to":[15,33,54],"maximize":[16],"social":[17],"welfare":[18],"an":[20],"online":[21,42,47,75],"model":[22],"where":[23,50],"agents":[24],"arrive":[25],"one":[26,28],"by":[27],"and":[29,36],"must":[30],"be":[31],"assigned":[32],"coalitions":[34,51],"immediately":[35],"irrevocably.":[37],"A":[38],"recurrent":[39],"theme":[40],"that":[46],"matching":[48],"algorithms,":[49],"are":[52,86],"restricted":[53],"size":[55],"at":[56],"most":[57],"2,":[58],"yield":[59],"good":[60],"competitive":[61,71],"ratios.":[62],"For":[63],"example,":[64],"computing":[65],"maximal":[66],"matchings":[67],"achieves":[68],"optimal":[70],"ratio":[72,79],"for":[73],"general":[74],"FHGs.":[76],"However,":[77],"this":[78],"bounded":[81],"only":[82],"if":[83],"agents'":[84],"valuations":[85],"themselves":[87],"bounded.":[88]},"counts_by_year":[],"updated_date":"2026-04-25T08:17:42.794288","created_date":"2026-01-08T00:00:00"}