{"id":"https://openalex.org/W4383557903","doi":"https://doi.org/10.1145/3580507.3597724","title":"Adwords with Unknown Budgets and Beyond","display_name":"Adwords with Unknown Budgets and Beyond","publication_year":2023,"publication_date":"2023-07-07","ids":{"openalex":"https://openalex.org/W4383557903","doi":"https://doi.org/10.1145/3580507.3597724"},"language":"en","primary_location":{"id":"doi:10.1145/3580507.3597724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3580507.3597724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th ACM Conference on Economics and Computation","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/A5055909322","display_name":"Rajan Udwani","orcid":"https://orcid.org/0000-0002-2112-4876"},"institutions":[{"id":"https://openalex.org/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]},{"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":true,"raw_author_name":"Rajan Udwani","raw_affiliation_strings":["UC Berkeley, Berkeley, United States of America"],"raw_orcid":"https://orcid.org/0000-0002-2112-4876","affiliations":[{"raw_affiliation_string":"UC Berkeley, Berkeley, United States of America","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055909322"],"corresponding_institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.5903,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67775446,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1128","last_page":"1128"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9941999912261963,"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.9876999855041504,"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.9189636707305908},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7883221507072449},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6640600562095642},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6234384179115295},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.6109127998352051},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5978091955184937},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5150684714317322},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.508391797542572},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4801218509674072},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4042566120624542},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3589644432067871},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23598983883857727},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1619618833065033},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07775187492370605}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9189636707305908},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7883221507072449},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6640600562095642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6234384179115295},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.6109127998352051},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5978091955184937},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5150684714317322},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.508391797542572},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4801218509674072},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4042566120624542},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3589644432067871},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23598983883857727},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1619618833065033},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07775187492370605},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3580507.3597724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3580507.3597724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 24th ACM Conference on Economics and Computation","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2036268824","https://openalex.org/W2809638413","https://openalex.org/W2799178702","https://openalex.org/W4302794097","https://openalex.org/W4300816375","https://openalex.org/W4286859947","https://openalex.org/W2009303716","https://openalex.org/W2949813243","https://openalex.org/W2807287186","https://openalex.org/W4383557903"],"abstract_inverted_index":{"We":[0,58,81,102],"consider":[1],"a":[2,19],"variation":[3],"of":[4,24,87,106,135],"the":[5,10,16,22,30,72,84,123,133],"classic":[6],"Adwords":[7],"problem":[8],"where":[9],"online":[11,130],"algorithm":[12,31,40,50,63,75,89,121],"does":[13],"not":[14],"know":[15],"advertisers'":[17],"budgets":[18],"priori":[20],"and":[21,47,70,113],"budget":[23,107],"an":[25,49,55],"advertiser":[26],"is":[27,35,41,90],"revealed":[28],"to":[29],"only":[32],"when":[33],"it":[34],"exceeded.":[36],"A":[37],"na\u00efve":[38],"greedy":[39],"0.5":[42,69],"competitive":[43,65,85],"for":[44,128],"this":[45],"setting":[46],"finding":[48],"with":[51,76],"better":[52,67,78],"performance":[53,79,126],"remained":[54],"open":[56],"problem.":[57],"show":[59,82,118],"that":[60,83,119],"no":[61],"deterministic":[62,129],"has":[64],"ratio":[66,86],"than":[68,98],"give":[71],"first":[73],"(randomized)":[74],"strictly":[77,96],"guarantee.":[80],"our":[88,120],"at":[91],"least":[92],"0.522":[93],"but":[94],"also":[95],"less":[97],"(1":[99],"\u2212":[100],"1/e).":[101],"present":[103],"novel":[104],"applications":[105],"oblivious":[108],"algorithms":[109],"in":[110,132],"search":[111],"ads":[112],"beyond.":[114],"In":[115],"particular,":[116],"we":[117],"achieves":[122],"best":[124],"possible":[125],"guarantee":[127],"matching":[131],"presence":[134],"multi-channel":[136],"traffic.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}