{"id":"https://openalex.org/W3119767894","doi":"https://doi.org/10.1109/cdc42340.2020.9303856","title":"Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis","display_name":"Optimal Online Algorithms for One-Way Trading and Online Knapsack Problems: A Unified Competitive Analysis","publication_year":2020,"publication_date":"2020-12-14","ids":{"openalex":"https://openalex.org/W3119767894","doi":"https://doi.org/10.1109/cdc42340.2020.9303856","mag":"3119767894"},"language":"en","primary_location":{"id":"doi:10.1109/cdc42340.2020.9303856","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9303856","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5011961584","display_name":"Ying Cao","orcid":"https://orcid.org/0000-0001-5529-0656"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Ying Cao","raw_affiliation_strings":["the Hong Kong University of Science and Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"the Hong Kong University of Science and Technology","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100642907","display_name":"Bo Sun","orcid":"https://orcid.org/0000-0003-3172-7811"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Bo Sun","raw_affiliation_strings":["the Hong Kong University of Science and Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"the Hong Kong University of Science and Technology","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040138091","display_name":"Danny H. K. Tsang","orcid":"https://orcid.org/0000-0003-0135-7098"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Danny H.K. Tsang","raw_affiliation_strings":["the Hong Kong University of Science and Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"the Hong Kong University of Science and Technology","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I200769079"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1064","last_page":"1069"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9966999888420105,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9937999844551086,"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/knapsack-problem","display_name":"Knapsack problem","score":0.8918805718421936},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.865894615650177},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7302485704421997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.662035346031189},{"id":"https://openalex.org/keywords/infinitesimal","display_name":"Infinitesimal","score":0.6321812868118286},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5798349380493164},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4831520915031433},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.4577746093273163},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.42712485790252686},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39161109924316406},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33408600091934204},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21305498480796814},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.10436797142028809}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8918805718421936},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.865894615650177},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7302485704421997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.662035346031189},{"id":"https://openalex.org/C91229774","wikidata":"https://www.wikidata.org/wiki/Q193885","display_name":"Infinitesimal","level":2,"score":0.6321812868118286},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5798349380493164},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4831520915031433},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4577746093273163},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.42712485790252686},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39161109924316406},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33408600091934204},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21305498480796814},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.10436797142028809},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cdc42340.2020.9303856","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9303856","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-108056","is_oa":false,"landing_page_url":"http://www.scopus.com/record/display.url?eid=2-s2.0-85099876403&origin=inward","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"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":"Conference paper"},{"id":"pmh:oai:repository.ust.hk:1783.1-108056","is_oa":false,"landing_page_url":"http://repository.ust.hk/ir/Record/1783.1-108056","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W22272998","https://openalex.org/W646988672","https://openalex.org/W1867397705","https://openalex.org/W1981427948","https://openalex.org/W2118877434","https://openalex.org/W2135324143","https://openalex.org/W2155551092","https://openalex.org/W2164792208","https://openalex.org/W2607684270","https://openalex.org/W2735725418","https://openalex.org/W2790598706","https://openalex.org/W2912618626","https://openalex.org/W2977419720","https://openalex.org/W3017792779","https://openalex.org/W3034621143","https://openalex.org/W4237922950","https://openalex.org/W4287559787","https://openalex.org/W6768030555","https://openalex.org/W6776324812"],"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/W2214256523","https://openalex.org/W3089449646"],"abstract_inverted_index":{"We":[0,97],"study":[1],"two":[2,46,69],"canonical":[3],"online":[4,19,76,87,117],"optimization":[5],"problems":[6,37,47,70],"under":[7,23,53],"capacity/budget":[8],"constraints:":[9],"the":[10,17,28,39,57,65,72,86,100,104,107,111,114,120],"fractional":[11],"one-way":[12],"trading":[13],"problem":[14,21],"(OTP)":[15],"and":[16,71,91,119,140],"integral":[18],"knapsack":[20],"(OKP)":[22],"an":[24],"infinitesimal":[25,101],"assumption.":[26],"Under":[27],"competitive":[29,42],"analysis":[30,90,115],"framework,":[31],"it":[32],"is":[33,60,106],"well-known":[34],"that":[35,99,109],"both":[36,95],"have":[38],"same":[40],"optimal":[41],"ratio.":[43],"However,":[44],"these":[45,68],"are":[48],"investigated":[49],"by":[50],"distinct":[51],"approaches":[52],"separate":[54],"contexts":[55],"in":[56,63,113,142],"literature.":[58],"There":[59],"a":[61,82,143],"gap":[62],"understanding":[64],"connection":[66],"between":[67],"nature":[73],"of":[74,103,116,122,138],"their":[75],"algorithm":[77,88],"design.":[78],"This":[79],"paper":[80],"provides":[81],"unified":[83,127],"framework":[84,130],"for":[85,94,134],"design,":[89],"optimality":[92],"proof":[93],"problems.":[96],"find":[98],"assumption":[102],"OKP":[105,139],"key":[108],"connects":[110],"OTP":[112,141],"algorithms":[118],"construction":[121],"worst-case":[123],"instances.":[124],"With":[125],"this":[126],"understanding,":[128],"our":[129],"shows":[131],"its":[132],"potential":[133],"analyzing":[135],"other":[136],"extensions":[137],"more":[144],"systematic":[145],"manner.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}