{"id":"https://openalex.org/W2070546659","doi":"https://doi.org/10.1145/1993574.1993581","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":2011,"publication_date":"2011-06-05","ids":{"openalex":"https://openalex.org/W2070546659","doi":"https://doi.org/10.1145/1993574.1993581","mag":"2070546659"},"language":"en","primary_location":{"id":"doi:10.1145/1993574.1993581","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993574.1993581","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM conference on Electronic commerce","raw_type":"proceedings-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":true,"raw_author_name":"Nikhil R. Devanur","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, 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":[{"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":"Kamal Jain","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"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/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Balasubramanian Sivan","raw_affiliation_strings":["Univ. of Wisconsin-Madison, Madison, WI, USA","University of Wisconsin- Madison Madison WI USA"],"affiliations":[{"raw_affiliation_string":"Univ. of Wisconsin-Madison, Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"University of Wisconsin- Madison Madison WI USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017900215","display_name":"Christopher A. Wilkens","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christopher A. Wilkens","raw_affiliation_strings":["Univ. of California at Berkeley, Berkeley, CA, USA","University of California at Berkeley, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"Univ. of California at Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California at Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5060217026"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":17.9057,"has_fulltext":false,"cited_by_count":168,"citation_normalized_percentile":{"value":0.99424717,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"29","last_page":"38"},"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.9979000091552734,"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.9915000200271606,"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/competitive-analysis","display_name":"Competitive analysis","score":0.7863963842391968},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6692196130752563},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6385669708251953},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5678195953369141},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5322990417480469},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.508429229259491},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4551430344581604},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.45327839255332947},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.44187504053115845},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.4137926697731018},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3772050142288208},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35484737157821655},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23789703845977783}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7863963842391968},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6692196130752563},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6385669708251953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5678195953369141},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5322990417480469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.508429229259491},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4551430344581604},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.45327839255332947},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.44187504053115845},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.4137926697731018},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3772050142288208},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35484737157821655},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23789703845977783},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1993574.1993581","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993574.1993581","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM conference on Electronic commerce","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1496647032","https://openalex.org/W1508467588","https://openalex.org/W1542279226","https://openalex.org/W1659045240","https://openalex.org/W1769120835","https://openalex.org/W1823461189","https://openalex.org/W2000109702","https://openalex.org/W2002272911","https://openalex.org/W2010060477","https://openalex.org/W2011730242","https://openalex.org/W2079669094","https://openalex.org/W2085938855","https://openalex.org/W2086561196","https://openalex.org/W2104103056","https://openalex.org/W2104224720","https://openalex.org/W2112741516","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/W2170675255","https://openalex.org/W4285719527","https://openalex.org/W6638690784"],"related_works":["https://openalex.org/W2094708479","https://openalex.org/W2059878569","https://openalex.org/W4316652420","https://openalex.org/W4281387385","https://openalex.org/W4310884475","https://openalex.org/W2019137296","https://openalex.org/W2016377267","https://openalex.org/W2567853751","https://openalex.org/W2963158951","https://openalex.org/W2070751425"],"abstract_inverted_index":{"We":[0],"present":[1],"algorithms":[2],"for":[3,80,181],"a":[4,43,55,76,158,186],"class":[5,24],"of":[6,25,57,93,97,108,114,139,161,188],"resource":[7,82,98],"allocation":[8,83],"problems":[9,26],"both":[10],"in":[11,19,164],"the":[12,20,34,38,48,58,65,81,87,91,94,105,109,112,115,123,137,165,178,182],"online":[13,39],"setting":[14,40],"with":[15,61,85],"stochastic":[16,50],"input":[17,51],"and":[18,111],"offline":[21],"setting.":[22],"This":[23],"contains":[27],"many":[28],"interesting":[29],"special":[30],"cases":[31],"such":[32,151],"as":[33],"Adwords":[35],"problem.":[36],"In":[37,71],"we":[41,74,174],"introduce":[42],"new":[44],"distributional":[45],"model":[46,60,73],"called":[47],"adversarial":[49],"model,":[52],"which":[53],"is":[54,126,136,148],"generalization":[56],"i.i.d":[59,166,183],"unknown":[62],"distributions,":[63],"where":[64,134,145],"distributions":[66],"can":[67,156],"change":[68],"over":[69],"time.":[70],"this":[72,146],"give":[75],"1-O(\u03b5)":[77],"approximation":[78],"algorithm":[79,155],"problem,":[84],"almost":[86],"weakest":[88],"possible":[89],"assumption:":[90],"ratio":[92,113,147,160,172],"maximum":[95],"amount":[96],"consumed":[99],"by":[100,118,185],"any":[101,119],"single":[102,120],"request":[103,121],"to":[104,122],"total":[106],"capacity":[107],"resource,":[110],"profit":[116,125],"contributed":[117],"optimal":[124],"at":[127],"most":[128],"(\u03b52/log(1/\u03b5)2)/(log":[129],"n":[130,135,150],"+":[131],"log":[132],"(1/\u03b5))":[133],"number":[138],"resources":[140],"available.":[141],"There":[142],"are":[143],"instances":[144],"#949;2/log":[149],"that":[152,173],"no":[153],"randomized":[154],"have":[157],"competitive":[159],"1-o(\u03b5)":[162],"even":[163],"model.":[167],"The":[168],"upper":[169],"bound":[170],"on":[171,177],"require":[175],"improves":[176],"previous":[179],"upper-bound":[180],"case":[184],"factor":[187],"n.":[189]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":21},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}