{"id":"https://openalex.org/W4416550261","doi":"https://doi.org/10.4230/lipics.icalp.2026.77","title":"Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines","display_name":"Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines","publication_year":2025,"publication_date":"2025-11-20","ids":{"openalex":"https://openalex.org/W4416550261","doi":"https://doi.org/10.4230/lipics.icalp.2026.77"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2511.16094","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.16094","pdf_url":"https://arxiv.org/pdf/2511.16094","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":"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/2511.16094","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dinitz, Michael","raw_affiliation_strings":["Johns Hopkins University, Baltimore, MD, USA"],"raw_orcid":"https://orcid.org/0000-0002-2632-966X","affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011772692","display_name":"Jeremy T. Fineman","orcid":"https://orcid.org/0009-0000-7483-4532"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fineman, Jeremy","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"raw_orcid":"https://orcid.org/0009-0000-7483-4532","affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066531115","display_name":"Seeun William Umboh","orcid":"https://orcid.org/0000-0001-6984-4007"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]},{"id":"https://openalex.org/I4210089412","display_name":"Applied Optimization (United States)","ror":"https://ror.org/004b0n253","country_code":"US","type":"company","lineage":["https://openalex.org/I4210089412"]}],"countries":["AU","US"],"is_corresponding":false,"raw_author_name":"Umboh, Seeun William","raw_affiliation_strings":["The University of Melbourne, Australia","ARC Training Centre in Optimisation Technologies, Integrated Methodologies, and Applications (OPTIMA), Parkville, Australia"],"raw_orcid":"https://orcid.org/0000-0001-6984-4007","affiliations":[{"raw_affiliation_string":"The University of Melbourne, Australia","institution_ids":["https://openalex.org/I165779595"]},{"raw_affiliation_string":"ARC Training Centre in Optimisation Technologies, Integrated Methodologies, and Applications (OPTIMA), Parkville, Australia","institution_ids":["https://openalex.org/I4210089412"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T12288","display_name":"Optimization and Search Problems","score":0.9488999843597412,"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.9488999843597412,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.027000000700354576,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.008799999952316284,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8909000158309937},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7815999984741211},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5600000023841858},{"id":"https://openalex.org/keywords/joint","display_name":"Joint (building)","score":0.5060999989509583},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.48170000314712524},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4081999957561493}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8909000158309937},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7815999984741211},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6371999979019165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6338000297546387},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5600000023841858},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.5060999989509583},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.48170000314712524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42089998722076416},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4081999957561493},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.35569998621940613},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3407000005245209},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.32919999957084656},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29159998893737793},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C2780964549","wikidata":"https://www.wikidata.org/wiki/Q5156353","display_name":"Competitive equilibrium","level":2,"score":0.257999986410141}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:arXiv.org:2511.16094","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.16094","pdf_url":"https://arxiv.org/pdf/2511.16094","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26466","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.77","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol374-icalp2026/LIPIcs.ICALP.2026.77/LIPIcs.ICALP.2026.77.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","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":"InProceedings"},{"id":"pmh:doi:10.4230/lipics.icalp.2026.77","is_oa":true,"landing_page_url":"https://proceedings.mlr.press/v202/davies23b.html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":null,"raw_type":"ConferencePaper"},{"id":"doi:10.48550/arxiv.2511.16094","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.16094","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":"Preprint"},{"id":"doi:10.4230/lipics.icalp.2026.77","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2026.77","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2511.16094","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.16094","pdf_url":"https://arxiv.org/pdf/2511.16094","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1,47],"considers":[2],"using":[3],"predictions":[4,111,143],"in":[5,113,188],"the":[6,9,27,33,39,52,56,66,70,76,99,110,116,123,133,142,148,153,158,168,177,206],"context":[7],"of":[8,24,32,41,45,69,101,115,118,193,199],"online":[10],"Joint":[11],"Replenishment":[12],"Problem":[13],"with":[14,209],"Deadlines":[15],"(JRP-D).":[16],"Prior":[17],"work":[18],"includes":[19],"asymptotically":[20,172],"optimal":[21],"competitive":[22,53,90,174,197],"ratios":[23],"$O(1)$":[25],"for":[26,55],"clairvoyant":[28,154],"setting":[29],"and":[30,104,136],"$O(\\sqrt{n})$":[31],"nonclairvoyant":[34,57,134,178],"setting,":[35],"where":[36,96],"$n$":[37,97],"is":[38,48,72,78,86,92,98,125,129,138,160,204],"number":[40,100,117],"items.":[42],"The":[43,83],"goal":[44],"this":[46,202,212],"to":[49,152,211],"significantly":[50],"reduce":[51],"ratio":[54,91,175,198],"case":[58],"by":[59],"leveraging":[60],"predictions:":[61],"when":[62],"a":[63,80,189,196],"request":[64,71],"arrives,":[65],"true":[67],"deadline":[68],"not":[73,161],"revealed,":[74],"but":[75],"algorithm":[77,88,124,149,169,203],"given":[79],"predicted":[81],"deadline.":[82],"main":[84],"result":[85],"an":[87,171],"whose":[89],"$O(\\min(\u03b7^{1/3}\\log^{2/3}(n),":[93],"\\sqrt\u03b7,":[94],"\\sqrt{n}))$,":[95],"item":[102,120],"types":[103],"$\u03b7\\leq":[105],"n^2$":[106],"quantifies":[107],"how":[108],"flawed":[109],"are":[112],"terms":[114],"``instantaneous":[119],"inversions.''":[121],"Thus,":[122],"robust,":[126],"i.e.,":[127,140],"it":[128,137],"never":[130],"worse":[131],"than":[132,176],"solution,":[135],"consistent,":[139],"if":[141,157],"exhibit":[144],"no":[145],"inversions,":[146],"then":[147,167],"behaves":[150],"similarly":[151],"algorithm.":[155,179],"Moreover,":[156],"error":[159,213],"too":[162],"large,":[163],"specifically":[164],"$\u03b7<":[165],"o(n^{3/2}/\\log^2(n))$,":[166],"obtains":[170],"better":[173],"We":[180],"also":[181],"show":[182],"that":[183],"all":[184],"deterministic":[185],"algorithms":[186,194],"falling":[187],"certain":[190],"reasonable":[191],"class":[192],"have":[195],"$\u03a9(\u03b7^{1/3})$,":[200],"so":[201],"nearly":[205],"best":[207],"possible":[208],"respect":[210],"metric.":[214]},"counts_by_year":[],"updated_date":"2026-07-18T07:39:51.176621","created_date":"2025-11-23T00:00:00"}