{"id":"https://openalex.org/W7162256331","doi":"https://doi.org/10.65109/avar7513","title":"Delayed Assignments in Online Non-Centroid Clustering with Stochastic Arrivals","display_name":"Delayed Assignments in Online Non-Centroid Clustering with Stochastic Arrivals","publication_year":2026,"publication_date":"2026-05-24","ids":{"openalex":"https://openalex.org/W7162256331","doi":"https://doi.org/10.65109/avar7513"},"language":"en","primary_location":{"id":"doi:10.65109/avar7513","doi":"https://doi.org/10.65109/avar7513","is_oa":false,"landing_page_url":"https://doi.org/10.65109/avar7513","pdf_url":null,"source":{"id":"https://openalex.org/S4306417597","display_name":"Adaptive Agents and Multi-Agents Systems","issn_l":"1548-8403","issn":["1548-8403"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2601.16091","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067895451","display_name":"Saar Cohen","orcid":"https://orcid.org/0000-0001-8262-405X","observed_orcids":["https://orcid.org/0000-0001-8262-405X"]},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]},{"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","IL"],"is_corresponding":true,"raw_author_name":"Saar Cohen","raw_affiliation_strings":["Department of Computer Science, Bar Ilan University & Department of Computer Science, University of Oxford, Ramat Gan, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Bar Ilan University & Department of Computer Science, University of Oxford, Ramat Gan, Israel","institution_ids":["https://openalex.org/I13955877","https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067895451"],"corresponding_institution_ids":["https://openalex.org/I13955877","https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30872483,"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.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.0017999999690800905,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/online-clustering","display_name":"online clustering","score":0.8539999723434448},{"id":"https://openalex.org/keywords/stochastic-arrivals","display_name":"stochastic arrivals","score":0.7720000147819519},{"id":"https://openalex.org/keywords/competitive-ratio","display_name":"competitive ratio","score":0.8069999814033508},{"id":"https://openalex.org/keywords/impossibility-results","display_name":"impossibility results","score":0.6019999980926514},{"id":"https://openalex.org/keywords/online-algorithms","display_name":"online algorithms","score":0.46799999475479126}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8029999732971191},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5730000138282776},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5627999901771545},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5475000143051147},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5364000201225281},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5097000002861023},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.5088000297546387},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4823000133037567},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4681999981403351},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.45809999108314514},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.45809999108314514},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42660000920295715},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.40059998631477356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37940001487731934},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.37610000371932983},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.37059998512268066},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.3449999988079071},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.33799999952316284},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32499998807907104},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3181000053882599},{"id":"https://openalex.org/C2780898871","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Performance metric","level":2,"score":0.3138999938964844},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.31380000710487366},{"id":"https://openalex.org/C149872217","wikidata":"https://www.wikidata.org/wiki/Q5265701","display_name":"Determining the number of clusters in a data set","level":5,"score":0.3012000024318695},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.26570001244544983},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.25920000672340393}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.65109/avar7513","doi":"https://doi.org/10.65109/avar7513","is_oa":false,"landing_page_url":"https://doi.org/10.65109/avar7513","pdf_url":null,"source":{"id":"https://openalex.org/S4306417597","display_name":"Adaptive Agents and Multi-Agents Systems","issn_l":"1548-8403","issn":["1548-8403"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2601.16091","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2601.16091","pdf_url":"https://arxiv.org/pdf/2601.16091","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2601.16091","doi":"https://doi.org/10.48550/arxiv.2601.16091","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.16091","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2601.16091","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2601.16091","pdf_url":"https://arxiv.org/pdf/2601.16091","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162256331.pdf","grobid_xml":"https://content.openalex.org/works/W7162256331.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1588038427","https://openalex.org/W2269088076","https://openalex.org/W4407222587","https://openalex.org/W7099955744","https://openalex.org/W2405339608","https://openalex.org/W7097238585","https://openalex.org/W7099166558","https://openalex.org/W2562111679","https://openalex.org/W7222958372","https://openalex.org/W2095128928"],"abstract_inverted_index":{"Clustering":[0],"is":[1,84,141,234,263],"a":[2,8,42,58,63,101,119,136,179,198,266],"fundamental":[3],"problem,":[4],"aiming":[5],"to":[6,28,32,70,91,95,115,142],"partition":[7],"set":[9],"of":[10,123,129,188,244,254],"elements,":[11,53],"like":[12],"agents":[13],"or":[14,99],"data":[15],"points,":[16],"into":[17],"clusters":[18],"such":[19],"that":[20,54,233],"elements":[21],"in":[22,34,62,151,172,185,237],"the":[23,125,139,145,155,164,186,218,238,242,247,250,255],"same":[24],"cluster":[25,98,153],"are":[26,205],"closer":[27],"each":[29,81,152],"other":[30,35],"than":[31,183],"those":[33],"clusters.":[36],"In":[37,163],"this":[38,106,109,192],"paper,":[39],"we":[40,112,195,229],"present":[41],"new":[43,102],"framework":[44],"for":[45,225],"studying":[46],"online":[47,88],"non-centroid":[48],"clustering":[49,257,262],"with":[50],"delays,":[51],"where":[52,169,202],"arrive":[55,171],"one":[56,103],"at":[57,105,118],"time":[59,209],"as":[60,241],"points":[61,150,170,245],"finite":[64,219],"metric":[65,220],"space,":[66],"should":[67],"be":[68,76,116],"assigned":[69],"clusters,":[71],"but":[72],"assignments":[73],"need":[74],"not":[75],"immediate.":[77],"Specifically,":[78],"upon":[79,132],"arrival,":[80],"point's":[82],"location":[83],"revealed,":[85],"and":[86,154,213,258],"an":[87,96,173,211,231,259],"algorithm":[89,177,232],"has":[90,178],"irrevocably":[92],"assign":[93],"it":[94],"existing":[97],"create":[100],"containing,":[104],"moment,":[107],"only":[108],"point.":[110],"However,":[111],"allow":[113],"decisions":[114,131],"postponed":[117],"delay":[120,157],"cost,":[121],"instead":[122],"following":[124],"more":[126],"common":[127],"assumption":[128],"immediate":[130],"arrival.":[133],"This":[134],"poses":[135],"critical":[137],"challenge:":[138],"goal":[140],"minimize":[143],"both":[144],"total":[146],"distance":[147],"costs":[148,158,253],"between":[149,249],"overall":[156,252],"incurred":[159],"by":[160,265],"postponing":[161],"assignments.":[162],"classic":[165],"worst-case":[166,227],"arrival":[167,200],"model,":[168,201],"arbitrary":[174],"order,":[175],"no":[176],"competitive":[180,236],"ratio":[181,248],"better":[182],"sublogarithmic":[184],"number":[187,243],"points.":[189],"To":[190],"overcome":[191],"strong":[193],"impossibility,":[194],"focus":[196],"on":[197],"stochastic":[199],"points'":[203],"locations":[204],"drawn":[206],"independently":[207],"across":[208],"from":[210],"unknown":[212],"fixed":[214],"probability":[215],"distribution":[216],"over":[217],"space.":[221],"We":[222],"offer":[223],"hope":[224],"beyond":[226],"adversaries:":[228],"devise":[230],"constant":[235],"sense":[239],"that,":[240],"grows,":[246],"expected":[251],"output":[256],"optimal":[260],"offline":[261],"bounded":[264],"constant.":[267]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2026-05-25T00:00:00"}