{"id":"https://openalex.org/W7081668996","doi":"https://doi.org/10.4230/lipics.approx/random.2025.9","title":"Optimal Competitive Ratio for Optimization Problems with Congestion Effects","display_name":"Optimal Competitive Ratio for Optimization Problems with Congestion Effects","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7081668996","doi":"https://doi.org/10.4230/lipics.approx/random.2025.9"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24375","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.9","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol353-approx-random2025/LIPIcs.APPROX-RANDOM.2025.9/LIPIcs.APPROX-RANDOM.2025.9.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol353-approx-random2025/LIPIcs.APPROX-RANDOM.2025.9/LIPIcs.APPROX-RANDOM.2025.9.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Fischer, Miriam","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Fischer, Miriam","raw_affiliation_strings":["Imperial College, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Imperial College, London, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Paccagnan, Dario","orcid":"https://orcid.org/0000-0002-8541-6966"},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paccagnan, Dario","raw_affiliation_strings":["Imperial College, London, UK"],"raw_orcid":"https://orcid.org/0000-0002-8541-6966","affiliations":[{"raw_affiliation_string":"Imperial College, London, UK","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":null,"display_name":"Vinci, Cosimo","orcid":"https://orcid.org/0000-0001-7741-9342"},"institutions":[{"id":"https://openalex.org/I142910587","display_name":"University of Salento","ror":"https://ror.org/03fc1k060","country_code":"IT","type":"education","lineage":["https://openalex.org/I142910587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Vinci, Cosimo","raw_affiliation_strings":["University of Salento, Lecce, Italy"],"raw_orcid":"https://orcid.org/0000-0001-7741-9342","affiliations":[{"raw_affiliation_string":"University of Salento, Lecce, Italy","institution_ids":["https://openalex.org/I142910587"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.57337629,"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":true,"primary_topic":{"id":"https://openalex.org/T12157","display_name":"Geochemistry and Geologic Mapping","score":0.6608999967575073,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12157","display_name":"Geochemistry and Geologic Mapping","score":0.6608999967575073,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T13067","display_name":"Geological Modeling and Analysis","score":0.02500000037252903,"subfield":{"id":"https://openalex.org/subfields/1906","display_name":"Geochemistry and Petrology"},"field":{"id":"https://openalex.org/fields/19","display_name":"Earth and Planetary Sciences"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14311","display_name":"Electrical and Electromagnetic Research","score":0.020400000736117363,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7099000215530396},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5511000156402588},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43130001425743103},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4092999994754791},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.39500001072883606},{"id":"https://openalex.org/keywords/diseconomies-of-scale","display_name":"Diseconomies of scale","score":0.39070001244544983},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.3862999975681305},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.365200012922287}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7099000215530396},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6085000038146973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5584999918937683},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5511000156402588},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43130001425743103},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4092999994754791},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.39500001072883606},{"id":"https://openalex.org/C1273860","wikidata":"https://www.wikidata.org/wiki/Q2517710","display_name":"Diseconomies of scale","level":3,"score":0.39070001244544983},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3862999975681305},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.365200012922287},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.3564999997615814},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.3474999964237213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28679999709129333},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.25189998745918274},{"id":"https://openalex.org/C2780964549","wikidata":"https://www.wikidata.org/wiki/Q5156353","display_name":"Competitive equilibrium","level":2,"score":0.25049999356269836},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:24375","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.9","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol353-approx-random2025/LIPIcs.APPROX-RANDOM.2025.9/LIPIcs.APPROX-RANDOM.2025.9.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.approx/random.2025.9","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.approx/random.2025.9","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24375","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2025.9","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol353-approx-random2025/LIPIcs.APPROX-RANDOM.2025.9/LIPIcs.APPROX-RANDOM.2025.9.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G731118236","display_name":null,"funder_award_id":"PE00000013","funder_id":"https://openalex.org/F4320321873","funder_display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca"},{"id":"https://openalex.org/G8697586648","display_name":null,"funder_award_id":"PE00000014","funder_id":"https://openalex.org/F4320321873","funder_display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca"}],"funders":[{"id":"https://openalex.org/F4320311030","display_name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","ror":"https://ror.org/01vx64p53"},{"id":"https://openalex.org/F4320317153","display_name":"DeepMind","ror":"https://ror.org/00971b260"},{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"},{"id":"https://openalex.org/F4320334079","display_name":"Gruppo Nazionale per il Calcolo Scientifico","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7081668996.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,93,138,181],"work":[2,96],"we":[3,141,163,189],"study":[4],"online":[5,17,55,102,145],"optimization":[6,62],"problems":[7,13,51,63,86],"with":[8,42,64,104,123],"congestion":[9,77],"effects.":[10],"These":[11],"are":[12],"where":[14],"tasks":[15],"arrive":[16],"and":[18,70,80,83,184],"a":[19,149,153,177],"decision":[20],"maker":[21],"is":[22,113,186],"required":[23],"to":[24,30,35,53,118,192],"allocate":[25],"them":[26],"on":[27,158],"the":[28,37,43,54,98,127,159,173],"fly":[29],"available":[31],"resources":[32,46],"in":[33,76,198],"order":[34],"minimize":[36],"cost":[38,75,112,171,196],"suffered,":[39],"which":[40],"grows":[41],"amount":[44],"of":[45,50,57,66,100,120,126,131],"used.":[47],"This":[48],"class":[49],"corresponds":[52],"counterpart":[56],"well-known":[58],"studied":[59],"problems,":[60],"including":[61],"diseconomies":[65],"scale":[67],"[Konstantin":[68],"Makarychev":[69],"Maxim":[71],"Sviridenko,":[72],"2018],":[73],"minimum":[74],"games":[78],"[Gairing":[79],"Paccagnan,":[81],"2023],":[82],"load":[84],"balancing":[85],"[Baruch":[87],"Awerbuch":[88],"et":[89],"al.,":[90],"1995].":[91],"Within":[92],"setting,":[94],"our":[95],"settles":[97],"problem":[99],"designing":[101],"algorithms":[103,109],"optimal":[105],"competitive":[106,150,178],"ratio,":[107],"i.e.,":[108],"whose":[110],"incurred":[111],"as":[114,116],"close":[115],"possible":[117],"that":[119,143],"an":[121],"oracle":[122],"complete":[124],"knowledge":[125],"future":[128],"instance":[129],"ahead":[130],"time.":[132,200],"We":[133],"provide":[134],"three":[135],"contributions":[136],"underpinning":[137],"result.":[139],"First,":[140],"show":[142,164,190],"no":[144],"algorithm":[146,175],"can":[147],"achieve":[148],"ratio":[151,179],"below":[152],"given":[154],"factor":[155],"depending":[156],"solely":[157],"resource":[160],"costs.":[161],"Second,":[162],"that,":[165],"when":[166],"guided":[167],"by":[168],"carefully":[169],"modified":[170,195],"functions,":[172],"greedy":[174],"achieves":[176],"matching":[180],"lower":[182],"bound":[183],"thus":[185],"optimal.":[187],"Finally,":[188],"how":[191],"compute":[193],"such":[194],"functions":[197],"polynomial":[199]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}