{"id":"https://openalex.org/W2909539666","doi":"https://doi.org/10.1145/3284177","title":"Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems","display_name":"Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems","publication_year":2019,"publication_date":"2019-01-09","ids":{"openalex":"https://openalex.org/W2909539666","doi":"https://doi.org/10.1145/3284177","mag":"2909539666"},"language":"en","primary_location":{"id":"doi:10.1145/3284177","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3284177","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},"type":"article","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/A5060217026","display_name":"Nikhil R. Devanur","orcid":"https://orcid.org/0009-0005-4406-5935"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nikhil R. Devanur","raw_affiliation_strings":["Microsoft Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041706388","display_name":"Kamal Jain","orcid":"https://orcid.org/0000-0001-5153-0405"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kamal Jain","raw_affiliation_strings":["Faira, Redmond, Kirkland, WA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faira, Redmond, Kirkland, WA,USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012130366","display_name":"Balasubramanian Sivan","orcid":"https://orcid.org/0000-0002-0188-7622"},"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":"Balasubramanian Sivan","raw_affiliation_strings":["Google Research, New York, NY, USA"],"raw_orcid":"https://orcid.org/0000-0002-0188-7622","affiliations":[{"raw_affiliation_string":"Google Research, New York, NY, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017900215","display_name":"Christopher A. Wilkens","orcid":null},"institutions":[{"id":"https://openalex.org/I4210099336","display_name":"Menlo School","ror":"https://ror.org/01240pn49","country_code":"US","type":"education","lineage":["https://openalex.org/I4210099336"]},{"id":"https://openalex.org/I4210114444","display_name":"Meta (United States)","ror":"https://ror.org/01zbnvs85","country_code":"US","type":"company","lineage":["https://openalex.org/I4210114444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christopher A. Wilkens","raw_affiliation_strings":["Facebook Research, Menlo Park, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facebook Research, Menlo Park, CA, USA","institution_ids":["https://openalex.org/I4210099336","https://openalex.org/I4210114444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.0165,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.97026834,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"66","issue":"1","first_page":"1","last_page":"41"},"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.9980000257492065,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7427420020103455},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.5784644484519958},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5770317912101746},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5711689591407776},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5320295691490173},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.5076309442520142},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.48043107986450195},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4507578909397125},{"id":"https://openalex.org/keywords/adversary-model","display_name":"Adversary model","score":0.4501771628856659},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.4224545955657959},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4146078824996948},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3102709650993347}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7427420020103455},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.5784644484519958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5770317912101746},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5711689591407776},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5320295691490173},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.5076309442520142},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.48043107986450195},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4507578909397125},{"id":"https://openalex.org/C7606001","wikidata":"https://www.wikidata.org/wiki/Q4686702","display_name":"Adversary model","level":3,"score":0.4501771628856659},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.4224545955657959},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4146078824996948},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3102709650993347},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3284177","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3284177","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4099999964237213,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W857716138","https://openalex.org/W1496647032","https://openalex.org/W1579500380","https://openalex.org/W1769120835","https://openalex.org/W1817513849","https://openalex.org/W1999069228","https://openalex.org/W2000109702","https://openalex.org/W2002272911","https://openalex.org/W2011730242","https://openalex.org/W2060049918","https://openalex.org/W2086189137","https://openalex.org/W2101199730","https://openalex.org/W2104103056","https://openalex.org/W2113098938","https://openalex.org/W2117595194","https://openalex.org/W2134422938","https://openalex.org/W2148352389","https://openalex.org/W2150865801","https://openalex.org/W2158268067","https://openalex.org/W2163656645","https://openalex.org/W2165956524","https://openalex.org/W2166588237","https://openalex.org/W2949804691","https://openalex.org/W2951097138","https://openalex.org/W2997634265","https://openalex.org/W4242790935","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W3022187609","https://openalex.org/W1580966357","https://openalex.org/W4287905780","https://openalex.org/W3000166930","https://openalex.org/W4287391919","https://openalex.org/W3120806613","https://openalex.org/W3154109599","https://openalex.org/W1587434700","https://openalex.org/W2772037640","https://openalex.org/W934350761"],"abstract_inverted_index":{"We":[0,27,79,97,247,313],"present":[1],"prior":[2],"robust":[3],"algorithms":[4,249],"for":[5,33,195],"a":[6,29,39,68,99,121,164,208,231,254,300],"large":[7,237],"class":[8],"of":[9,42,56,71,120,167,197,211,215,219,256,278,290,310,316],"resource":[10],"allocation":[11],"problems":[12],"where":[13,132,274],"requests":[14,77,146],"arrive":[15],"one-by-one":[16],"(online),":[17],"drawn":[18,148],"independently":[19],"from":[20,143],"an":[21,47,133,137,160,204],"unknown":[22],"distribution":[23,175,221],"at":[24,149],"every":[25,34],"step.":[26,151],"design":[28,159,203],"single":[30,65,301],"algorithm":[31,48,161,183,205,233,292],"that,":[32],"possible":[35,194],"underlying":[36,123],"distribution,":[37,124,189,200],"obtains":[38,163],"1\u2212\u03f5":[40,165,209],"fraction":[41,70,166,210],"the":[43,51,72,82,106,118,127,141,145,156,168,173,177,182,191,198,212,216,222,226,258,275,287,291,307,330],"profit":[44,170,193,218],"obtained":[45],"by":[46,75],"that":[49,81,87,105,162,206],"knows":[50],"entire":[52],"request":[53,66,302],"sequence":[54],"ahead":[55],"time.":[57],"The":[58],"factor":[59,255],"\u03f5":[60,91],"approaches":[61,92],"0":[62],"when":[63,304],"no":[64,153],"consumes/contributes":[67],"significant":[69,299],"global":[73],"consumption/contribution":[74],"all":[76,311],"together.":[78],"show":[80],"tradeoff":[83,107],"we":[84,114,125,158,202,229],"obtain":[85],"here":[86],"determines":[88],"how":[89,298],"fast":[90,232],"0,":[93],"is":[94,184,293,303],"near":[95],"optimal:":[96],"give":[98,230,248],"nearly":[100],"matching":[101],"lower":[102],"bound":[103],"showing":[104],"cannot":[108],"be":[109],"improved":[110],"much":[111],"beyond":[112,117],"what":[113],"obtain.":[115],"Going":[116],"model":[119],"static":[122],"introduce":[126],"adversarial":[128,178],"stochastic":[129],"input":[130],"model,":[131],"adversary,":[134,157],"possibly":[135],"in":[136,176],"adaptive":[138],"manner,":[139],"controls":[140],"distributions":[142],"which":[144],"are":[147],"each":[150,196,220],"Placing":[152],"restriction":[154],"on":[155],"optimal":[169,192,217],"obtainable":[171],"w.r.t.":[172],"worst":[174],"sequence.":[179],"Further,":[180],"if":[181],"given":[185],"one":[186],"number":[187],"per":[188],"namely":[190],"adversary\u2019s":[199],"then":[201],"achieves":[207],"weighted":[213],"average":[214],"adversary":[223],"picks.":[224],"In":[225],"offline":[227],"setting":[228],"to":[234,250,306,319],"solve":[235,252],"very":[236],"linear":[238],"programs":[239],"(LPs)":[240],"with":[241,262],"both":[242],"packing":[243],"and":[244,295,329],"covering":[245],"constraints.":[246],"approximately":[251],"(within":[253],"1+\u03f5)":[257],"mixed":[259],"packing-covering":[260],"problem":[261],"O":[263],"(\u03b3":[264],"m":[265,285],"log":[266],"(":[267],"n":[268,283],"/\u03b4)/\u03f5":[269],"2":[270],")":[271],"oracle":[272],"calls":[273],"constraint":[276],"matrix":[277],"this":[279],"LP":[280],"has":[281],"dimension":[282],"\u00d7":[284],",":[286],"success":[288],"probability":[289],"1\u2212\u03b4,":[294],"\u03b3":[296],"quantifies":[297],"compared":[305],"sum":[308],"total":[309],"requests.":[312],"discuss":[314],"implications":[315],"our":[317],"results":[318],"several":[320],"special":[321],"cases":[322],"including":[323],"online":[324],"combinatorial":[325],"auctions,":[326],"network":[327],"routing,":[328],"adwords":[331],"problem.":[332]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":17},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}