{"id":"https://openalex.org/W2101199730","doi":"https://doi.org/10.1145/2229012.2229043","title":"Asymptotically optimal algorithm for stochastic adwords","display_name":"Asymptotically optimal algorithm for stochastic adwords","publication_year":2012,"publication_date":"2012-06-04","ids":{"openalex":"https://openalex.org/W2101199730","doi":"https://doi.org/10.1145/2229012.2229043","mag":"2101199730"},"language":"en","primary_location":{"id":"doi:10.1145/2229012.2229043","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2229012.2229043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th ACM Conference on Electronic Commerce","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/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, Redmond, WA, USA"],"raw_orcid":null,"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":["University of Wisconsin-Madison, Madison, WI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison, Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yossi Azar","raw_affiliation_strings":["Tel-Aviv University, Tel-Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.5257,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.96144433,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"388","last_page":"404"},"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.9998000264167786,"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.9929999709129333,"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.9172148704528809},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6627544164657593},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.5516070127487183},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.493569016456604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49155816435813904},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.472523033618927},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4473593831062317},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4459293782711029},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36000198125839233},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2638862729072571}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9172148704528809},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6627544164657593},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.5516070127487183},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.493569016456604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49155816435813904},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.472523033618927},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4473593831062317},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4459293782711029},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36000198125839233},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2638862729072571},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2229012.2229043","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2229012.2229043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th ACM Conference on Electronic Commerce","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.415.3453","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.3453","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pages.cs.wisc.edu/~balu2901/papers/2012/adwords_optimal.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W205662698","https://openalex.org/W1496647032","https://openalex.org/W1542279226","https://openalex.org/W1769120835","https://openalex.org/W1783659154","https://openalex.org/W1982971964","https://openalex.org/W2010060477","https://openalex.org/W2036457487","https://openalex.org/W2070546659","https://openalex.org/W2079669094","https://openalex.org/W2104224720","https://openalex.org/W2113098938","https://openalex.org/W2158268067","https://openalex.org/W2170675255","https://openalex.org/W2176174872","https://openalex.org/W2912211078","https://openalex.org/W2949904805","https://openalex.org/W2951400471","https://openalex.org/W4252172911","https://openalex.org/W6638087223"],"related_works":["https://openalex.org/W4299302777","https://openalex.org/W2777812223","https://openalex.org/W2087343661","https://openalex.org/W1996806106","https://openalex.org/W2951573806","https://openalex.org/W2058681277","https://openalex.org/W1772565852","https://openalex.org/W2922865928","https://openalex.org/W4383557903","https://openalex.org/W1963663039"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,59],"consider":[4,14],"the":[5,9,15,18,56,72,94,115,134,153,157,163,170,173],"adwords":[6],"problem":[7],"in":[8,162],"unknown":[10],"distribution":[11],"model.":[12],"We":[13,69],"case":[16],"where":[17],"budget":[19,155],"to":[20,84,114,169,196,213],"bid":[21,175],"ratio":[22,49,58,75,99,122],"k":[23,78],"is":[24,61,65,100,112,138,181,202,211],"at":[25],"least":[26],"2,":[27],"and":[28,63,156,165],"give":[29],"improved":[30],"competitive":[31,36,48,57,74,121],"ratios.":[32],"Earlier":[33],"results":[34],"had":[35],"ratios":[37],"better":[38,203],"than":[39,204],"1-1/e":[40],"only":[41],"for":[42,67,76,145],"\"large":[43],"enough\"":[44],"k,":[45],"while":[46],"our":[47,128,199],"increases":[50],"continuously":[51],"with":[52,103,172],"k.":[53],"For":[54],"k=2":[55],"get":[60,119],"0.729":[62],"it":[64,117,141],"0.9":[66],"k=16.":[68],"also":[70],"improve":[71],"asymptotic":[73],"large":[77],"from":[79],"1":[80,85,124],"-":[81,86,125],"O(\u221alog":[82],"n/k)":[83],"O(\u221a1/k),":[87],"thus":[88],"removing":[89],"any":[90],"dependence":[91],"on":[92,133,149,183],"n,":[93],"number":[95,159],"of":[96,123,160],"advertisers.":[97],"This":[98],"optimal,":[101],"even":[102,108],"known":[104],"distributions.":[105],"That":[106],"is,":[107],"if":[109],"an":[110],"algorithm":[111,129,137,164,201,208],"tailored":[113],"distribution,":[116],"cannot":[118],"a":[120,143,167,184,205],"o(\u221a1/k),":[126],"whereas":[127],"does":[130],"not":[131],"depend":[132],"distribution.":[135],"The":[136,179],"rather":[139],"simple,":[140],"computes":[142],"score":[144],"every":[146],"advertiser":[147,171],"based":[148,182],"his":[150,177],"original":[151],"budget,":[152],"remaining":[154,158],"steps":[161],"assigns":[166],"query":[168],"highest":[174],"plus":[176],"score.":[178],"analysis":[180],"\"hybrid":[185],"argument\"":[186],"that":[187,190,198],"considers":[188],"algorithms":[189],"are":[191],"part":[192,194],"actual,":[193],"hypothetical,":[195],"prove":[197],"(actual)":[200],"completely":[206],"hypothetical":[207],"whose":[209],"performance":[210],"easy":[212],"analyze.":[214]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}