{"id":"https://openalex.org/W3036588290","doi":"https://doi.org/10.1145/3548774","title":"Online Algorithms for Weighted Paging with Predictions","display_name":"Online Algorithms for Weighted Paging with Predictions","publication_year":2022,"publication_date":"2022-08-12","ids":{"openalex":"https://openalex.org/W3036588290","doi":"https://doi.org/10.1145/3548774","mag":"3036588290"},"language":"en","primary_location":{"id":"doi:10.1145/3548774","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3548774","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3548774","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3548774","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012071418","display_name":"Zhihao Jiang","orcid":"https://orcid.org/0000-0002-9682-2476"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zhihao Jiang","raw_affiliation_strings":["Stanford University, CA, USA"],"raw_orcid":"https://orcid.org/0000-0002-9682-2476","affiliations":[{"raw_affiliation_string":"Stanford University, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":["Duke University, NC, USA"],"raw_orcid":"https://orcid.org/0000-0003-1799-6660","affiliations":[{"raw_affiliation_string":"Duke University, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103267354","display_name":"Kevin Sun","orcid":"https://orcid.org/0000-0001-8672-6790"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kevin Sun","raw_affiliation_strings":["Duke University, NC, USA"],"raw_orcid":"https://orcid.org/0000-0001-8672-6790","affiliations":[{"raw_affiliation_string":"Duke University, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012071418"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.9971,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.7600184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"18","issue":"4","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T11478","display_name":"Caching and Content Delivery","score":0.9801999926567078,"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.9728000164031982,"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/paging","display_name":"Paging","score":0.9843623638153076},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7756713628768921},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6911234855651855},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6397826671600342},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5941166877746582},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5668932795524597},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4595872461795807},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4252583682537079},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.32277506589889526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18630152940750122},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08466082811355591}],"concepts":[{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.9843623638153076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7756713628768921},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6911234855651855},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6397826671600342},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5941166877746582},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5668932795524597},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4595872461795807},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4252583682537079},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32277506589889526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18630152940750122},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08466082811355591},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3548774","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3548774","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3548774","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3548774","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3548774","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3548774","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1082722339","display_name":null,"funder_award_id":"CCF-1750140","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3975607665","display_name":"Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization","funder_award_id":"1955703","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5226018963","display_name":"CAREER: New Directions in Graph Algorithms","funder_award_id":"1750140","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5857933033","display_name":"AitF: FULL: Collaborative Research: Optimizing Networked Systems with Limited Information","funder_award_id":"1535972","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7291707221","display_name":null,"funder_award_id":"CCF-1535972","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3036588290.pdf","grobid_xml":"https://content.openalex.org/works/W3036588290.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1987225815","https://openalex.org/W2033156334","https://openalex.org/W2041645394","https://openalex.org/W2044156187","https://openalex.org/W2054033098","https://openalex.org/W2089998595","https://openalex.org/W2121033525","https://openalex.org/W2295428206","https://openalex.org/W2560674852","https://openalex.org/W2890643081","https://openalex.org/W2891784792","https://openalex.org/W2909813108","https://openalex.org/W2945946294","https://openalex.org/W2963785501","https://openalex.org/W2986547560","https://openalex.org/W3001957700","https://openalex.org/W3009680754","https://openalex.org/W3125910951","https://openalex.org/W3138855735","https://openalex.org/W3178731179"],"related_works":["https://openalex.org/W1481323420","https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W2617423316","https://openalex.org/W4390751688","https://openalex.org/W4316652420","https://openalex.org/W2168823865","https://openalex.org/W1602169857","https://openalex.org/W4310884475"],"abstract_inverted_index":{"In":[0],"this":[1],"article,":[2],"we":[3,85],"initiate":[4],"the":[5,8,16,57,71,82,101],"study":[6],"of":[7,19,28,56,81,103,121,124],"weighted":[9,76],"paging":[10,40],"problem":[11],"with":[12,24,41,107],"predictions.":[13,42],"This":[14],"continues":[15],"recent":[17],"line":[18],"work":[20],"in":[21,75],"online":[22],"algorithms":[23,106],"predictions,":[25],"particularly":[26],"that":[27,45],"Lykouris":[29],"and":[30,34,111,115],"Vassilvitski":[31],"(ICML":[32],"2018)":[33],"Rohatgi":[35],"(SODA":[36],"2020)":[37],"on":[38],"unweighted":[39,47],"We":[43,98],"show":[44],"unlike":[46],"paging,":[48],"neither":[49],"a":[50,54,79,95,119],"fixed":[51],"lookahead":[52],"nor":[53],"knowledge":[55],"next":[58],"request":[59,89],"for":[60,66,118],"every":[61],"page":[62],"is":[63],"sufficient":[64],"information":[65],"an":[67],"algorithm":[68],"to":[69,93],"overcome":[70],"existing":[72],"lower":[73,116],"bounds":[74,117],"paging.":[77],"However,":[78],"combination":[80],"two,":[83],"which":[84],"call":[86],"strong":[87],"per":[88],"prediction":[90,109,125],"(SPRP),":[91],"suffices":[92],"give":[94,112],"2-competitive":[96],"algorithm.":[97],"also":[99],"explore":[100],"question":[102],"gracefully":[104],"degrading":[105],"increasing":[108],"error,":[110],"both":[113],"upper":[114],"set":[120],"natural":[122],"measures":[123],"error.":[126]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}