{"id":"https://openalex.org/W3171115302","doi":"https://doi.org/10.1145/3406325.3465354","title":"Chasing convex bodies with linear competitive ratio (invited paper)","display_name":"Chasing convex bodies with linear competitive ratio (invited paper)","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3171115302","doi":"https://doi.org/10.1145/3406325.3465354","mag":"3171115302"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3465354","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3465354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-abstract","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022627445","display_name":"C. J. Argue","orcid":"https://orcid.org/0000-0003-4578-6476"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. J. Argue","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065794037","display_name":"Guru Guruganesh","orcid":"https://orcid.org/0000-0003-0963-3843"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guru Guruganesh","raw_affiliation_strings":["Google Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090045552","display_name":"Ziye Tang","orcid":"https://orcid.org/0000-0001-8060-2041"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ziye Tang","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9667999744415283,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11031","display_name":"Game Theory and Applications","score":0.9639999866485596,"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/competitive-analysis","display_name":"Competitive analysis","score":0.738811731338501},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6973292231559753},{"id":"https://openalex.org/keywords/convex-body","display_name":"Convex body","score":0.6599123477935791},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6294405460357666},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6194258332252502},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6151559948921204},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5207431316375732},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5042427778244019},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.49541914463043213},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46608489751815796},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.45178186893463135},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.42626631259918213},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4109201729297638},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39171335101127625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3790663480758667},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37426459789276123},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3197956383228302},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.31235364079475403},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.13591426610946655},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10527259111404419},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06779256463050842}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.738811731338501},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6973292231559753},{"id":"https://openalex.org/C134912446","wikidata":"https://www.wikidata.org/wiki/Q5166516","display_name":"Convex body","level":4,"score":0.6599123477935791},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6294405460357666},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6194258332252502},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6151559948921204},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5207431316375732},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5042427778244019},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.49541914463043213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46608489751815796},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.45178186893463135},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.42626631259918213},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4109201729297638},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39171335101127625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3790663480758667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37426459789276123},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3197956383228302},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.31235364079475403},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.13591426610946655},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10527259111404419},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06779256463050842},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3406325.3465354","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3406325.3465354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"The":[0],"problem":[1,66],"of":[2,14,25,42,87,115,119],"chasing":[3],"convex":[4,15,121],"functions":[5,16],"is":[6,28,63],"easy":[7],"to":[8,29],"state:":[9],"faced":[10],"with":[11,91],"a":[12,31,92,120],"sequence":[13],"f":[17,46],"t":[18,34,47,49,56,59],"over":[19],"d-dimensional":[20],"Euclidean":[21],"spaces,":[22],"the":[23,26,40,43,52,76,85,99,113,116],"goal":[24],"algorithm":[27,90],"output":[30],"point":[32,118],"x":[33,58],"at":[35],"each":[36],"time,":[37],"so":[38],"that":[39,95],"sum":[41],"function":[44],"costs":[45,54],"(x":[48],"),":[50],"plus":[51],"movement":[53],"||x":[55],"\u2212":[57,60],"1":[61],"||":[62],"minimized.":[64],"This":[65],"generalizes":[67],"questions":[68],"in":[69],"online":[70],"algorithms":[71],"such":[72],"as":[73],"caching":[74],"and":[75,82],"k-server":[77],"problem.":[78],"In":[79,102],"1994,":[80],"Friedman":[81],"Linial":[83],"posed":[84],"question":[86],"getting":[88],"an":[89,107],"competitive":[93],"ratio":[94],"depends":[96],"only":[97],"on":[98,112],"dimension":[100],"d.":[101],"this":[103],"talk":[104],"we":[105],"give":[106],"O":[108],"(d)-competitive":[109],"algorithm,":[110],"based":[111],"notion":[114],"Steiner":[117],"body.":[122]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}